1.
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?
Answer: Option 'B'
Since queue follows FIFO so new element inserted at last.
2.
The essential condition which is checked before deletion in a linked queue is?
Answer: Option 'B'
To check whether there is element in the list or not.
3.
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?
Answer: Option 'C'
Since its the starting of queue, so both values are changed.
4.
In linked list implementation of a queue, from where is the item deleted?
Answer: Option 'A'
At the head of link list
Since queue follows FIFO so new element deleted from first.
5.
In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.
Answer: Option 'A'
AVAIL
All the nodes are collected in AVAIL list.
6.
In linked list implementation of a queue, the important condition for a queue to be empty is?
Answer: Option 'A'
Because front represents the deleted nodes.
7.
The essential condition which is checked before insertion in a linked queue is?
Answer: Option 'B'
To check whether there is space in the queue or not.
8.
Which of the following is true about linked list implementation of queue?
Answer: Option 'C'
It can be done by both the methods.
9.
In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
Answer: Option 'D'
Since front pointer is used for deletion, so worst time for the other two cases.
10.
In linked list implementation of a queue, where does a new element be inserted?
Answer: Option 'C'
Since queue follows FIFO so new element inserted at last.