Queues Questions

MCQ bookmark_border

11.

Which data structure is used in breadth first search of a graph to hold nodes?

A

Stack

B

queue

C

Tree

D

Array

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

A

Input restricted dequeue

B

Output restricted qequeue

C

Priority queues

D

Stack

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

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

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

In a circular queue the value of r will be ..

A

r=r+1

B

r=(r+1)% [QUEUE_SIZE

C

r=(r+1)% QUEUE_SIZE

D

r=(r-1)% QUEUE_SIZE

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

A

Insertion

B

Deletion

C

Retrieval

D

Traversal

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

Which of the following is not the type of queue?

A

Ordinary queue

B

Single ended queue

C

Circular queue

D

Priority queue

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

A data structure where elements can be added or removed at either end but not in the middle is called

A

linked lists

B

stacks

C

queues

D

dequeue

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

A

A

circular queue

B

random of queue

C

priority

D

dequeue

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

19.

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

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

20.

A data structure where elements can be added or removed at either end but not in the middle

A

Linked lists

B

Stacks

C

Queues

D

Deque

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion