Menu

Question Discussion & Solution

MCQ

Q.

Which data structure allows deleting data elements from front and inserting at rear?

A

Stacks

B

Queues

C

Deques

D

Binary search 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.

If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

A

?(n), ?(n)

B

?(n), ?(1)

C

?(1), ?(n)

D

?(1), ?(1)

Discussion

MCQ

2.

A

Insertion

B

Deletion

C

Retrieval

D

Traversal

Discussion

MCQ

3.

A queue is a ?

A

FIFO (First In First Out) list

B

LIFO (Last In First Out) list

C

Ordered array

D

Linear tree

Discussion

MCQ

4.

n elements of a Queue are to be reversed using another queue. The number of

A

2*n

B

4*n

C

n

D

The task cannot be accomplished

Discussion

MCQ

5.

The essential condition which is checked before deletion in a linked queue is?

A

Underflow

B

Overflow

C

Front value

D

Rear value

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