Menu

Question Discussion & Solution

MCQ

Q.

What will be the postfix form of the above expression -(A+B)*(C*D-E)*F/G

A

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

B

A B + C D ∗ E − F G / ∗ ∗

C

A B + C D ∗ E − F G ∗ / ∗

D

None of these

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.

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

A

Stack

B

Queue

C

Tree

D

Array

Discussion

MCQ

2.

If the elements

A

ABCD

B

DCBA

C

DCAB

D

ABDC

Discussion

MCQ

3.

A stack works on the principle of____________.

A

LIFO

B

LAFO

C

LIFF

D

None of the above

Discussion

MCQ

4.

Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation.
The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression?

A

1

B

2

C

3

D

4

Discussion

MCQ

5.

The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is

A

600

B

350

C

650

D

588

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