In linked list implementation of a queue, front and rear pointers are – McqOptions

MCQOPTIONS

1.	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
Answer» D. No pointer will be changed

Discussion

No Comment Found

Related MCQs

Which of the following is true about linked list implementation of queue?
The essential condition which is checked before deletion in a linked queue is?
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?
THE_ESSENTIAL_CONDITION_WHICH_IS_CHECKED_BEFORE_DELETION_IN_A_LINKED_QUEUE_IS??$
Which of the following is true about linked list implementation of queue?$
The essential condition which is checked before insertion in a linked queue is?
In linked list implementation of a queue, the important condition for a queue to be empty is?
In linked list implementation of a queue, from where is the item deleted?
In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.
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?