Queue Implementation Test - 2

1. In linked list implementation of a queue, where does a new element be inserted?

At the centre position in the link list

At any position in the linked list

At the head of link list

At the tail of the link list

2. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?

Only rear pointer

No pointer will be changed

Only front pointer

Both front and rear pointer

3. The essential condition which is checked before insertion in a linked queue is?

Overflow

Underflow

Front value

Rear value

4. The essential condition which is checked before deletion in a linked queue is?

Front value

Rear value

Underflow

Overflow

5. In linked list implementation of a queue, from where is the item deleted?

Node before the tail

At the head of link list

At the tail of the link list

At the centre position in the link list

6. Which of the following is true about linked list implementation of queue?

In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from beginning

In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end

In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning

In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from end

7. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

REAR

NULL

AVAIL

FRONT

8. In linked list implementation of a queue, the important condition for a queue to be empty is?

LINK is empty

FRONT==REAR-1

REAR is null

FRONT is null

9. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

To empty a queue

Both Insertion and To empty a queue

Insertion

Deletion

10. In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?

Only rear pointer

No pointer will be changed

Both front and rear pointer

Only front pointer