Chapter 20, Problem 1MC

Program Description Answer

A Queue is a linear data structure in which items are accessed first-in-first-out fashion.

Hence, the correct answer is option “B”.

Explanation of Solution

Queue:

• Queue is a linear data structure used to store a set of data.
• Queue is the collection of data which are accessed in FIFO (first-in-first-out) order for performing operations on it.
• Queue is opened at both the ends. One end to insert the items into the queue and the other end is to remove the items from the queue.
• There are two basic operations on queue data structure,
  • enqueue() – add an item to queue.
  • dequeue() – remove an item from the queue.
• Queue does not have fixed size.

Explanation for incorrect options:

A. Stack

A stack is used to store set of data that are accessed in last-in-first-out order.

Hence, option “A” is wrong.

C. Linked list

A linked list is a collection of data items. This stored item is accessed in random order for doing operations on it.

Hence, option “C” is wrong.

D. Array based collection

An array based collection (simply array) used to store set of items. Each stored item is accessed using array index or key.

Hence, option “D” is wrong.