Stack Operation Test

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

xyzp+**qr+s*+

xyz*+pq*r+s*+

xyz+*pq*r+s*+

xyz*+pq*r+s+*

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

Infix Expression

Both Prefix and Postfix Expressions

Postfix Expression

Prefix Expression

3. 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?

ABCD

DCAB

ABDC

DCBA

4. 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?

a b c x + d e f ^ ^ -

a b c x + d e ^ f ^ -

- + a x b c ^ ^ d e f

a b + c x d – e ^ f ^

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

650

350

600

588

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

Stack is the FIFO data structure

Null link is present in the last node at the bottom of the stack

Linked List are used for implementing Stacks

Top of the Stack always contain the new node

7. Which of the following is not an inherent application of stack?

Job scheduling

Reversing a string

Implementation of recursion

Evaluation of postfix expression

8. 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 is?

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

(A B D +⋀ E F – / G +)

(A B D ⋀ + E F/- G +)

(A B D E F + ⋀ / - G +)

(A B D ⋀ + E F – / G +)