Menu

Question Discussion & Solution

MCQ

Q.

The postfix form of the following infix notation is : (A + B)* (C*D − E)* F

A

AB + CD*E - *F*

B

AB+ CDE + - * F*

C

AB+ CD - EF + - **

D

ABCDEF* - + * +

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.

When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.

A

-1

C

1

D

x

Discussion

MCQ

2.

The data structure needed to convert a recursion to an iterative procedure is ............

A

Queue

B

Graph

C

Stack

D

Tree

Discussion

MCQ

3.

Which among the following is not a palindrome?

A

Madam

B

Dad

C

Malayalam

D

Maadam

Discussion

MCQ

4.

Stack cannot be used to

A

Evaluation of Expression in Postfix form

B

Reversing String

C

Implementation of Recursion

D

Allocating Resources and Scheduling

Discussion

MCQ

5.

The prefix form of an infix expression p + q

A

#NAME?

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