Test: Queue - 2 - CUET Humanities MCQ

The queue data structure is used in time sharing system in which programs are placed in the data structure waiting to be executed by the CPU.

The statement Load(); creates a queue and moves all the elements (objects) into their respective queue position.

In a linear queue, the traversal through the queue is possible only once, i.e., once an element is deleted, we cannot insert another element in its position.

Output-restricted deque allows insertion at both ends but deletion only at one end.

A deque is a queue in which elements can be inserted and deleted either from front or rear. Elements cannot be inserted or deleted from the middle.

This is a queue in which insertion and deletion take place at both the ends.

Queue operates on FRONT & REAR pointers, FRONT pointer is used to access the data and REAR pointer is used to insert the data.

A dequeue (Double Ended Queue) is a data structure in which elements can be added or removed from the ends (front or rear). Elements of a dequeue can be scattered in different groups of storage, with the container keeping the necessary information internally to provide direct access to any of its elements in constant time and with a uniform sequential interface.

In a linear queue data structure, enqueue is the process of insertion which takes place from the REAR end only, whereas the process of deletion is called dequeue which takes place from the FRONT end only.

The queue data structure is not applicable in management of files on disk.