Queue Quiz

What does FIFO stand for in the context of a queue?

• First In, Last Out

• Last In, First Out

• First In, First Out

• Free In, Free Out

Where is a new element added in a queue?

• Front

• Middle

• Rear

• Random position

Which operation removes an item from the front of the queue?

• Enqueue

• Dequeue

• Queue Front

• Queue Rear

What does the *Queue Front* operation do?

• Deletes the front element

• Retrieves the rear element

• Retrieves the front element without removing it

• Inserts a new element at the front

Which metadata attributes are required in the head structure for a linked list queue?

• `front`, `count`, `capacity`

• `front`, `rear`, `count`

• `size`, `rear`, `count`

• `front`, `rear`, `size`

Why is a circular array queue useful?

• It allows random access to elements

• It reuses empty spaces when elements are dequeued

• It uses less memory than a linked list

• It sorts elements automatically

Which principle does job scheduling using a queue follow?

• LIFO

• FILO

• FIFO

• Priority-based

When does a queue enter an *underflow* state?

• When the queue is full

• When an invalid operation is performed

• When attempting to dequeue from an empty queue

• When memory is exhausted

When does a queue enter an *overflow* state?

• When the queue is empty

• When there is no memory to enqueue a new item

• When the rear pointer is null

• When the queue has exactly one element

What does the `destroyQueue` algorithm do?

• Deletes all elements and resets metadata

• Sorts the queue elements

• Converts the queue to a stack

• Merges two queues