Menu

Question Discussion & Solution

MCQ

Q.

An infix expression can be converted to a postfix expression using a .................

A

Stack

B

Queue

C

Dequeue

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 postfix equivalent of the prefix * + a b - c d is

A

ab+cd-*

B

ab + cd * -

C

ab + - cd *

D

ab cd + - *

Discussion

MCQ

2.

What is the functionality of the following piece of Java code?

Assume:

A

print alternate elements of array

B

duplicate the given array

C

parentheses matching

D

reverse the array

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.

Which data structure is used for implementing recursion?

A

Queue

B

Stack

C

Arrays

D

List

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