Fill in the blank

(a) …………… is a linear list of elements in which insertion and deletion takes place from different ends.

(b) Operations on a queue are performed in …………… order.

(c) Insertion operation in a queue is called …………… and deletion operation in a queue is called …………… .

(d) Deletion of elements is performed from …………… end of the queue.

(e) Elements 'A', 'S', 'D' and 'F' are present in the queue, and they are deleted one at a time, …………… is the sequence of element received.

(f) …………… is a data structure where elements can be added or removed at either end, but not in the middle.

(g) A deque contains 'z', 'x', 'c', 'v' and 'b' . Elements received after deletion are 'z', 'b', 'v', 'x' and 'c'. …………… is the sequence of deletion operation performed on deque.

(a) Queue

(b) FIFO

(c) enqueue, dequeue

(d) front

(e) 'A', 'S', 'D', 'F'

(f) Deque

(g)

deletionFront()
deletionRear()
deletionRear()
deletionFront()
deletionFront()