Menu

Question Discussion & Solution

MCQ

Q.

One can determine whether an infix expression has balanced parenthesis or not by using .............

A

Array

B

Queue

C

Stack

D

Tree

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.

A

Stack

B

Queue

C

List

D

Link list

Discussion

MCQ

2.

If memory for the run-time stack is only 150 cells(words), how big can N be in Factorial(N) before encounterring stack overflow?

A

13

B

26

C

31

D

45

Discussion

MCQ

3.

Which data structure is needed to convert infix notation to postfix notation?

A

Branch

B

Queue

C

Tree

D

Stack

Discussion

MCQ

4.

To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?

A

1

B

2

C

3

D

4

Discussion

MCQ

5.

The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

A

AB+ CD*E

B

AB + CD* E

C

AB + CD* E

D

AB + CDE *

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