Note 1
##### Take Note:

Take a note while surfing.

##### Note With Ink

Give your Note a Colorful Tag.

##### Easy to Access

Stay on same information and in Sync wherever you are.

Note 2
##### Take Note:

Organize your information,It may take Shape.

##### Think With Ink

Differ your Content by Color.

##### Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3
##### Take Note:

Don't Let information to miss,Because it take shape

##### Note With Ink

Simple an Easy Way to take a note.

##### Easy to Access

Get the same in next visit.

# Data Structures :: Stacks

Home > Data Structures > Stacks > General Questions

#### Co. Cloud

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  nagarro

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  Wipro

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

5. The data structure required to evaluate a postfix expression is

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

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

| | | |

Explanation:

Here is no explanation for this answer

Workspace

Tags:  No Tags on this question yet!

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

| | | |