Stacks

What will the stack contain after the following actions?

Push(1);

Push(2);

Push(3);

Push(4);

Pop();

Pop();

Push(5);

• 1, 2, 3

• 1, 2, 3, 5

• 1, 2, 3, 4

• 1, 2, 5

Convert the infix exression

(A + B) * (C + D)

to Postfix.

• A B C * + D +

• A B + C D + *

• A B * C D * +

• A B + C + D +

Time complexity in accessing top element in stack in

• O(1)

• O(n)

• O(n^2)

• O(n*n)

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 no of element present on stack are

• 1

• 2

• 3

• 4

If the sequence of operations

push(1)

push(3)

pop

push(2)

push(2)

pop

pop

pop

push(3)

pop

are performed on a stack, the order of popped out values

• 3, 2, 2, 3, 1

• 3, 2, 1, 3, 2

• 2, 3, 2, 3, 1

• 1, 3, 2, 2, 3

What is the value of the postfix expression 6 3 2 4 + – *

• -18

• 1

• 40

• 74

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

• AB + CDE * - * F *G /

• AB+ CD*E - FG /**

• AB + CD* E - F **G /

• AB + CD* E - *F *G /

Convert the following Infix expression to Postfix form using a stack

x + y * z + (p * q + r) * s

• xyz*+pq*r+s*+

• xyz*+pq*r+s+*

• xyz+*pq*r+s*+

• none

You can replace any element position in the stack.

• True

• False

Evaluate the given postfix expression 7 8 2 * 4 / +

• 7

• 11

• 8

• None of the Above