data structures

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is

• A

• B

• C

• D

Which of the following permutation can be obtained in the same order using a stack assuming that input is the sequence 5, 6, 7, 8, 9 in that order?

• 7, 8, 9, 5, 6

• 5, 9, 6, 7, 8

• 7, 8, 9, 6, 5

• 9, 8, 7, 5, 6

If the sequence of operations - push (10), push (20), pop, push (10), push (20), pop, pop, pop, push (20), pop are performed on a stack, the sequence of popped out values

The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is

A function f defined on stacks of integers satisfies the following properties. f(∅) = 0 and f (push (S, i)) = max (f(S), 0) + i for all stacks S and integers i.

If a stack S contains the integers 2, -3, 2, -1, 2 in order from bottom to top, what is f(S)?

Consider the C program attached

What is the output of the program for the following input ? 5 2 * 3 3 2 + * +

Consider the function fun(). What does the function print?

Convert the following infix expression to both postfix and prefix

A-B/(C*D^E)

The following postfix expression with single digit operands is evaluated using a stack:

8 2 3 ^ / 2 3 * + 5 1 * -

The top two elements of the stack after the first * is evaluated are

Convert the following postfix expression to infix with parenthesis included abc*de-/+