DSA-23-7-25

Which pointer is updated when a new element is enqueued into a queue implemented using a linked list?

• tail pointer
• head pointer
• front pointer
• rear pointer

What happens when the last element is dequeued from a queue implemented using a linked list?

• The queue becomes empty, and head and tail pointers are set to null.
• The last element is moved to the front of the queue.
• The queue automatically resets to its initial state.
• The queue retains the last element as a placeholder.

In a linked list-based queue, which condition checks if the queue is empty?

• front == rear

• rear == NULL

• front == NULL

• front == rear == NULL

Which operation removes the first element of a queue?

• peek
• pop
• enqueue
• dequeue

What data structure is used internally to implement a queue using a linked list?

• Tree
• Singly Linked list

• Stack
• Array

What happens if we try to dequeue from an empty linked list-based queue?

• The queue automatically resets itself to a default state.
• The last element is returned instead of an error.
• The operation completes successfully without any changes.
• An error or exception is raised indicating the queue is empty.

What is the first step in the enqueue(data) algorithm for a linked list queue?

• Return the current size of the queue.
• Create a new node with the given data.
• Check if the queue is empty before adding data.
• Remove the first node from the queue.

When enqueuing in a linked list queue, which of these is the correct final step?

• Set the new node's next pointer to null.
• Update the tail pointer to the new node.
• Remove the head pointer from the queue.
• Delete the previous tail node.

Which line correctly updates the front pointer during dequeue in a linked list queue?

• front = front.last
• front = front.previous
• front = front.first
• front = front.next

What happens to rear when the last node is dequeued in a queue using linked list?

• rear pointers become null

• The rear pointer points to the previous node.
• The queue remains unchanged.
• Only the front pointer becomes null.