Menu

Question Discussion & Solution

MCQ

Q.

Evaluate Postfix expression from given infix expression.A + B * (C + D) / F + D * E

A

AB+CD*F/+D*E

B

ABCD+*F/+DE*+

C

ABCD+*/F+DE*

D

AB+CD*F/+DE*

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

In a Stack the command to access nth element from the top of the stacks will be

A

S[Top-n]

B

S [Top+n]

C

S [top-n-1]

D

None of the above

Discussion

MCQ

2.

Stack is useful for implementing

A

Radix

B

Recursion

C

Breadth first search

D

None of these

Discussion

MCQ

3.

In Reverse Polish notation, expression A*B+C*D is written as

A

AB*CD*+

B

A*BCD*+

C

AB*CD+*

D

A*B*CD+

Discussion

MCQ

4.

What does

A

accessing item from an undefined stack

B

adding items to a full stack

C

removing items from an empty stack

D

index out of bounds exception

Discussion

MCQ

5.

If the elements

A

ABCD

B

DCBA

C

DCAB

D

ABDC

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs