Menu

Question Discussion & Solution

MCQ

Q.

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)

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.

Which of the following is not the type of queue?

A

Ordinary queue

B

Single ended queue

C

Circular queue

D

Priority queue

Discussion

MCQ

2.

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

3.

In a priority queue, insertion and deletion takes place at

A

front, rear end

B

only at rear end

C

only at front end

D

any position

Discussion

MCQ

4.

In linked list implementation of a queue, the important condition for a queue to be empty is?

A

FRONT is null

B

REAR is null

C

LINK is empty

D

None of the mentioned

Discussion

MCQ

5.

A

Stack

B

Queue

C

List

D

None of the above

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