APPLICATIONS OF STACK

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

• 1

• 2

• 3

• 4

The prefix form of an infix expression (p + q) – (r * t) is?

• a) + pq – *rt

• b) – +pqr * t

• c) – +pq * rt

• d) – + * pqrt

The prefix form of A-B/ (C * D ^ E) is?

• a) -/*^ACBDE

• b) -ABCD*^DE

• c) -A/B*C^DE

• d) -A/BC*^DE

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

• a) AB+ CD*E – FG /**

• b) AB + CD* E – F **G /

• c) AB + CD* E – *F *G /

• d) AB + CDE * – * F *G

If there's no base criteria in a recursive program, the program will

• not be executed

• executed until all condition matches

• executes infinitely

• obtain progressive approach

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.

• a) xyz*+pq*r+s*+

• b) xyz*+pq*r+s+*

• c) xyz+*pq*r+s*+

• d) xyzp+**qr+s*+

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

• a) Reversing a string

• b) Evaluation of postfix expression

• c) Implementation of recursion

• d) Job scheduling

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

• a) Infix Expression

• b) Prefix Expression

• c) Postfix Expression

• d) Both Prefix and Postfix Expressions

What is the infix equivalent for the following postfix expression?

3 5 6 + *

• 5 + 6 * 3

• 5 + (3 * 6)

• (5 + 6) * 3

• 5 (+ 6 * 3)

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

• 284

• 213

• 142

• 71