Question

Match List I with List II

LIST I	LIST II
C. Deletion operation	IV. Dequeue
A. Insertion in a queue at	I. FRONT
B. Deletion in a queue at	III. REAR
D. Insertion operation	II. Enqueue

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

Hint:

In a queue, elements are inserted from the rear (enqueue) and removed from the front (dequeue), which is characteristic of FIFO (First In, First Out) data structure.

Answer 1

The Correct Option is B

Insertion in a queue at FRONT corresponds to Enqueue (A–II). This refers to adding an element at the front of the queue (as in a deque).

Deletion in a queue at FRONT corresponds to Dequeue (B–I), which removes an element from the front of the queue.

Deletion operation at the rear is associated with Rear (C–IV), since deletion can occur from the rear in certain queue implementations such as a deque.

Insertion operation is associated with Rear (D–III), because in a standard queue, insertion (enqueue) typically occurs at the rear end.

Therefore, the correct matching is: A–II, B–I, C–IV, D–III.