Queues Questions

MCQ bookmark_border

21.

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

A

Stacks

B

Queues

C

Deques

D

Binary search tree

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

22.

Let the following circular queue can accommodate maximum six elements with the following data
front = 2 rear = 4
queue = _______, L, M, N, ___, ___ 

What will happen after ADD O operation takes place?

A

front = 2 rear = 5 queue = ______, L, M, N, O, ___

B

front = 3 rear = 5 queue = L, M, N, O, ___

C

front = 3 rear = 4 queue = ______; L, M, N, O, ___

D

front = 2 rear = 4 queue = L, M, N, O, ___

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

23.

A queue is a,

A

FIFO (First In First Out) list

B

LIFO (Last In First Out) list

C

Ordered array

D

Linear tree

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

24.

A common example of a queue is people waiting in line at a__________.

A

Bus stop

B

Movie hall

C

Shopping mall

D

None of the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

25.

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

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

26.

Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?

A

Fifo queue

B

Ascending priority queue

C

Descending priority queue

D

None of these

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

27.

A priority queue is used to implement a stack S that stores characters PUSH(C)is implemented as INSERT(Q,C,K)where K is an appropriate integer key chosen by the implementation.POP is implemented as DELETEMIN(Q)(Q). For a sequence of operations, the keys chosen are in

A

Non-increasing order

B

Non-decreasing order

C

Strictly increasing order

D

Strictly decreasing order

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

28.

Number of "ADD" and "REMOVE" operations required to access n/2th elements of a queue of "n" elements so that the original queue remain the same after the access is (take help of another queue.)

A

2*n

B

4*n

C

8*n

D

8*n-1

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

29.

The initial configuration of a queue is a, b, c, d, ('a' is in the front end). To get the configuration d, c, b, a, one needs a minimum of

A

2 deletions and 3 additions

B

3 deletion and 2 additions

C

3 deletions and 3 additions

D

3 deletions and 4 additions

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

30.

Queue can be used to implement

A

recursion

B

radix sort

C

quick sort

D

depth first search

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion