Question

Match LIST-I with LIST-II

\[\begin{array}{|c|c|}\hline \text{LIST-I} & \text{LIST-II} \\ \hline \text{A. The first index comes after the last index.} & \text{I. Head-tail Linked List} \\ \hline \text{B. More than one queue in the same array of sufficient size} & \text{IV. Multiple Queue} \\ \hline \text{C. Elements can be inserted or deleted at either end.} & \text{III. Circular Queue} \\ \hline \text{D. Each element is assigned a priority.} & \text{II. Priority Queue} \\ \hline \end{array}\] Choose the correct answer from the options given below:

• A. A - I, B - II, C - III, D - IV
• B. A - I, B - III, C - II, D - IV
• C. A - I, B - II, C - IV, D - III
• D. A - III, B - I, C - D, I - II

Hint:

When dealing with data structures, it is important to understand how the data is stored, accessed, and removed. This helps in correctly identifying each type of queue.

Answer 1

The Correct Option is A

Step 1: Option Evaluation.

• A. The first index follows the last index. This defines a Head-tail Linked List, characterized by the initial index appearing after the final element. This aligns with I. Head-tail Linked List.
• B. Multiple queues share a sufficiently sized array. This describes a Priority Queue, where various queues can coexist within the same memory allocation, distinguished by their assigned priorities. This matches II. Priority Queue.
• C. Elements are insertable or deletable at either end. This characteristic defines a Circular Queue, allowing for the addition or removal of elements from both extremities. This corresponds to III. Circular Queue.
• D. Each element is assigned a priority. This is the defining feature of a Multiple Queue, where individual elements are associated with a specific priority level. This matches IV. Multiple Queue.

Step 2: Determination.

Therefore, the accurate correspondence is (1) A - I, B - II, C - III, D - IV.