Menu

Question Discussion & Solution

MCQ

Q.

Queue can be used to implement

A

recursion

B

radix sort

C

quick sort

D

depth first search

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.

In a queue, the initial values of front pointer f rare pointer r should be

A

0 and 1

B

0 and -1

C

-1 and 0

D

1 and 0

Discussion

MCQ

2.

What is the time complexity to insert a node based on key in a priority queue?

A

O(nlogn)

B

O(logn)

C

O(n)

D

O(n^2)

Discussion

MCQ

3.

A

A

circular queue

B

random of queue

C

priority

D

dequeue

Discussion

MCQ

4.

What is the need for a circular queue?

A

effective usage of memory

B

easier computations

C

all of the mentioned

D

none of the mentioned

Discussion

MCQ

5.

A

A

Queue linked list

B

Stacks linked list

C

Both of them

D

Neither of them

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