Menu

Question Discussion & Solution

MCQ

Q.

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

A

Stack

B

Queue

C

Array

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.

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.

A stack works on the principle of____________.

A

LIFO

B

LAFO

C

LIFF

D

None of the above

Discussion

MCQ

3.

Well formed parenthesis can be checked using following data structure ?

A

Queue

B

Stack

C

Hash Map

D

List

Discussion

MCQ

4.

Prefix notation is also known as

A

Reverse Polish Notation

B

Reverse Notation

C

Polish Reverse Notation

D

Polish Notation

Discussion

MCQ

5.

push() and pop() functions are found in

A

queues

B

lists

C

stacks

D

trees

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