Menu

Question Discussion & Solution

MCQ

Q.

The process of accessing data stored in a serial access memory is similar to manipulating data on a

A

heap

B

queue

C

stack

D

binary 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.

Pushing an element into stack already having five elements and stack size of 5 , then stack becomes

A

Overflow

B

Crash

C

Underflow

D

User flow

Discussion

MCQ

2.

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

MCQ

3.

What will be the postfix expression for following infix expression:b * c + d / e

A

b*cde/+

B

bcd*e/+

C

bc*de/+

D

bc*de+/

Discussion

MCQ

4.

Which data structure can be used suitably to solve the Tower of Hanoi problem?

A

Tree

B

Heap

C

Priority queue

D

Stack

Discussion

MCQ

5.

Which of the following data structures can be used for parentheses matching?

A

n-ary tree

B

queue

C

priority queue

D

stack

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