Q. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is?

View solution

Q. Convert the following infix expressions into its equivalent postfix expressions
(A + B ⋀D)/(E – F)+G

View solution

Q. Convert the following Infix expression to Postfix form using a stack
x + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.

View solution

Q. Which of the following statement(s) about stack data structure is/are NOT correct?

View solution

Q. 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

View solution

Q. The type of expression in which operator succeeds its operands is?

View solution

Q. 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 – d ^ e ^ f is

View solution

Q. If the elements “A”, “B”, “C” and “D” are placed in a stack and are deleted one at a time, what is the order of removal?

View solution

Q. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?

View solution

Q. The data structure required for Breadth First Traversal on a graph is?

View solution

Q. A queue is a ?

View solution

Q. If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

View solution

Q. A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?

View solution

Q. A normal queue, if implemented using an array of size MAX_SIZE, gets full when

View solution

Q. Which of the following real world scenarios would you associate with a stack data structure?

View solution

Q. What does ‘stack underflow’ refer to?

View solution

Q. What is the time complexity of pop() operation when the stack is implemented using an array?

View solution

Q. Which of the following array position will be occupied by a new element being pushed for a stack of size N elements(capacity of stack > N).

View solution

Q. What happens when you pop from an empty stack while implementing using the Stack ADT in Java?

View solution

Q. ‘Array implementation of Stack is not dynamic’, which of the following statements supports this argument?

View solution