Data Structures (3130702) MCQs

MCQs of Linear Data Structure: Queue

Showing 1 to 4 out of 4 Questions
1.

......... form of access is used to add and remove nodes from a queue.

(a)

LIFO, Last In First Out
(b)

FIFO, First In First Out
(c)

Both LIFO & FIFO
(d)

None of these
Answer:

Option (b)

2.

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

(a)

ABCD
(b)

DCBA
(c)

DCAB
(d)

DABC
Answer:

Option (a)

3.

A circular queue is implemented using an array of size 10. The array index starts at 0, the front is 6, and the rear is 9. The insertion of the next element takes place at the array index.

(a)

0
(b)

7
(c)

9
(d)

10
Answer:

Option (a)

4.

A normal queue, if implemented using an array of size MAX_SIZE, gets full when

(a)

Rear=MAX_SIZE-1
(b)

Front=(rear+1)mod MAX_SIZE
(c)

Front=rear+1
(d)

Rear=front
Answer:

Option (a)

Showing 1 to 4 out of 4 Questions