Menu

Stacks Questions

MCQ
131.
Convert the following infix expressions into its equivalent postfix expressions(A + B ?D)/(E
forum Discussion
MCQ
132.
Convert the following Infix expression to Postfix form using a stackx + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.
forum Discussion
MCQ
133.
Which of the following statement(s) about stack data structure is/are NOT correct?
forum Discussion
MCQ
134.
Consider the following operation performed on a stack of size 5.
Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);

After the completion of all operation, the number of elements present in stack are
forum Discussion
MCQ
135.
The type of expression in which operator succeeds its operands is?
forum Discussion
MCQ
136.
Assume that the operators +,-, X are left associative and ^ is right associative.The order of precedence (from highest to lowest) is ^, X, +, -. The postfix expression for the infix expression a + b X c
forum Discussion
MCQ
137.
If the elements
forum Discussion
MCQ
138.
If the elements
forum Discussion
MCQ
139.
A normal queue, if implemented using an array of size MAX_SIZE, gets full when
forum Discussion
MCQ
140.
Which of the following real world scenarios would you associate with a stack data structure?
forum Discussion