Data Structures :: Stacks

Home > Data Structures > Stacks > General Questions

1 / 37

 The five items: A,B,C,D and E are pushed in stack, one after the other starting from A. The stack is

Is popped four items and each element is inserted in a queue. Then 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.

Answer: Option D

Explanation:

Here is no explanation for this answer

Workspace


Tags:  nagarro

2 / 37

 Convert the infix to postfix for A-(B+C)*(D/E)

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  Wipro

3 / 37

 What is the postfix form of the following prefix expression -A/B*C$DE

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

4 / 37

 The minimum number of multiplications and additions required to evaluate the polynomial
P = 4x^3+3x^2-15x+45 is

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

5 / 37

 The data structure required to evaluate a postfix expression is

Answer: Option B

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

6 / 37

 The data structure required to check whether an expression contains balanced parenthesis is

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

7 / 37

 The process of accessing data stored in a serial access memory is similar to manipulating data on a

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

8 / 37

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

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

9 / 37

 The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum

Answer: Option C

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!

10 / 37

 What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?

Answer: Option A

Explanation:

Here is no explanation for this answer

Workspace


Tags:  No Tags on this question yet!