Queues

What is the principle that a queue data structure follows?

• Last Come First Served (LCFS)

• First Come Last Served (FCLS)

• First In First Out (FIFO)

• Last In First Out (LIFO)

What operation is referred to as enqueuing in a queue?

• Checking if the queue is full

• Checking if the queue is empty

• Inserting an element

• Deleting an element

Which of the following is NOT a type of queue mentioned in the text?

• Priority Queue

• Stack Queue

• Circular Queue

• Linear Queue

What does the term 'deque' stand for?

• Double Ended Queue

• Dynamic Queue

• Data Entry Queue

• Direct End Queue

In a linear queue, what condition must be checked before inserting an element?

• QUEUE_EMPTY

• QUEUE_FULL

• QUEUE_OVERFLOW

• QUEUE_UNDERFLOW

What is the main limitation of linear queues?

• They can only be implemented using arrays.

• They can only store integers.

• They do not support deletion.

• They may reject insertions despite available space.

How is a circular queue different from a linear queue?

• It does not support deletion operations.

• It can only store a fixed number of elements.

• It allows for circular movement of front and rear.

• It uses a linked list for implementation.

What is the purpose of the mod operator in circular queues?

• To sort the elements in the queue.

• To check if the queue is full.

• To calculate the size of the queue.

• To determine the next location in a circular manner.

In a priority queue, how are items inserted or deleted?

• Based on their type.

• Based on their order of arrival.

• Based on their priority.

• Based on their size.

What is an input restricted deque?

• Insertions are allowed at both ends.

• Insertions are allowed at one end only.

• Deletions are allowed at both ends.

• Deletions are allowed at one end only.