Post has shared content
New Chapter Update (Linked Stacks)
DS & A(Stacks - Pointer Based)
DS & A(Stacks - Pointer Based)
thesuperprogrammer.com

Post has attachment
Do the following operations using Bitwise operator.

1) Right-Shift for a decimal number from 0 to 2.
2) Left-Shift for a decimal number from 0 to 2.

Input-Output format:
Input consists of a number.
Refer Sample Input/Output for Output format.

Sample Input and Output I:
Enter a number:
2
Right shift by 0: 2
Right shift by 1: 1
Right shift by 2: 0
Left shift by 0: 2
Left shift by 1: 4
Left shift by 2: 8

Post has attachment
Introduction to Stack Data Structure

The stack is an ordered set of elements in which insertion and deletion are from one end of the stack called the top of the stack. It is a Last in First Out structure.

A. Static Implementation:
A stack is implemented statically by using an array of size MAX to hold stack elements and an integer top storing the position of the top of the stack. A stack is a single entity that is a structure made up of both the array and the top. The stack elements can be integers, characters, strings or user-defined types.

Post has attachment
There are 3 labs in the CSE department(L1, L2, and L3) with a seating capacity of x, y, and z. A single lab needs to be allocated to a class of 'n' students. The labs need to be utilized to the maximum i.e the number of systems that are not being used should be minimal. Which lab needs to be allocated to this class?

Input and Output Format:
Assume that x, y, and z are always distinct.
Refer sample input and output.

All text in bold corresponds to the input and the rest corresponds to output.
Sample Input and Output:
Enter x
30
Enter y
40
Enter z
20
Enter n
25
L1 should be allocated to this class

Post has attachment
Short Answer Type Question In C/C++

Post has attachment
Write a C++ code to implement Stack ADT and understand its basic operations.

A Stack is an ordered list in witch insertion and deletion are made at one end called the Top. The restrictions on the stack imply that if we add the elements 1,2,3,4,5 to the stack in that order, then 5 is the first element we delete from the stack. The add operation is called “Push”, and the delete operation is called “Pop”. Since the last element pushed into the stack is the first element popped, a stack is also known as a Last In First Out (LIFO) List.

Post has attachment
Write A C Program To Perform The Insertion Into A B-Tree.

Post has attachment
In the Mini project 8th module is to find the number of vowel letters in a word(consider both uppercase and lowercase). Rita allotted this function to Patrick.
Help Patrick to write a program to find the number of vowel letters in a word.
Function Specification:
int findNumberOfVowels(char *);
Input format :
Input consists of a string.
Output format :
The output consists of an integer saying the number of the vowel in the given word.
Refer sample Input and Output for further specifications.
[ All text of bold corresponds to the input and the rest corresponds to output. ]

Sample Input and Output format :
Enter the word :
Alice
Count of vowels in Alice is 3
Count vowel
Count vowel
smartcode4u.blogspot.in

Post has attachment
Write a program to perform matrix multiplication. Assume only square matrices of the same dimension.

Input Format:
The input consists of (2*(m*m)+1) integers.
The first integer corresponds to m, the number of rows/columns in the matrix.
The next m*m integers correspond to the elements in the first matrix.
The last m*m elements correspond to the elements in the second matrix. The elements are read in row-wise order, the first row first, then second row and so on. Assume that the maximum value of m is 10.

Sample Input :
Enter the number of rows and columns in 2 matrices
2
Enter the elements in the first matrix
4 5
6 9
Enter the elements in the second matrix
1 2
3 4

Sample Output:
19 28
33 48
Matrix Multiplication
Matrix Multiplication
smartcode4u.blogspot.in

Post has shared content
The third video from TheSuperProgrammer is out... Have a look at it, feedbacks are really appreciated.

Don't forget to like and Subscribe : )
Wait while more posts are being loaded