Menu

Question Discussion & Solution

MCQ

Q.

Post fix form of following infix expression is -(A + B) * (C + D - E) * F

A

AB + CDE + - * F *

B

ABCDEF*-+*+

C

AB + CD - EF + - * *

D

AB + CD + E - * F *

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.

Stack is useful for implemeting

A

recursion

B

depth first search

C

both (a) and (b)

D

breadth first search

Discussion

MCQ

2.

What will be the postfix expression for following infix expression - A / B ^ C - D

A

A B / ^ C D -

B

A B ^ / C D -

C

A B C ^ / D -

D

A B C / ^ D -

Discussion

MCQ

3.

The prefix form of an infix expression A+B-C*D is

A

+AB-*CD

B

-+A B C * D

C

-+A B * C D

D

- + *ABCD

Discussion

MCQ

4.

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

A

B C * C - D A / E E + / +

B

B C C * - D A / E E + / +

C

B C C - * D A / E E + / +

D

B C C - * D / A E E + / +

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