In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
a) Insertion
b) Deletion
c) To empty a queue
d) Both Insertion and To empty a queue
Explanation: Since front pointer is used for deletion, so worst time for the other two cases.
In linked list implementation of a queue, where does a new element be inserted?
a) At the head of link list
b) At the centre position in the link list
c) At the tail of the link list
d) At any position in the linked list
Explanation: Since queue follows FIFO so new element inserted at last.
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?
a) Only front pointer
b) Only rear pointer
c) Both front and rear pointer
d) No pointer will be changed
Explanation: Since queue follows FIFO so new element inserted at last.
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?
a) Only front pointer
b) Only rear pointer
c) Both front and rear pointer
d) No pointer will be changed
Explanation: Since its the starting of queue, so both values are changed.
In case of insertion into a linked queue, a node borrowed from the…
list is inserted in the queue.
a) AVAIL
b) FRONT
c) REAR
d) NULL
Explanation: All the nodes are collected in AVAIL list.
In linked list implementation of a queue, from where is the item deleted?
a) At the head of link list
b) At the centre position in the link list
c) At the tail of the link list
d) Node before the tail
Explanation: Since queue follows FIFO so new element deleted from first.
