Queue using Linked List MCQ

Test your knowledge with important Queue using Linked List MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Queue using Linked List MCQs at Bissoy

• Which of the following is true about linked list implementation of queue?
  ক

  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

  ঘ

  In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from beginning
• The essential condition which is checked before deletion in a linked queue is?
  ক

  Underflow

  খ

  Overflow

  গ

  Front value

  ঘ

  Rear value
• The essential condition which is checked before insertion in a linked queue is?
  ক

  Underflow

  খ

  Overflow

  গ

  Front value

  ঘ

  Rear value
• In linked list implementation of a queue, the important condition for a queue to be empty is?
  ক

  FRONT is null

  খ

  REAR is null

  গ

  LINK is empty

  ঘ

  FRONT==REAR-1
• In linked list implementation of a queue, from where is the item deleted?
  ক

  At the head of link list

  খ

  At the centre position in the link list

  গ

  At the tail of the link list

  ঘ

  Node before the tail
• In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.
  ক

  AVAIL

  খ

  FRONT

  গ

  REAR

  ঘ

  NULL
• 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 front pointer

  খ

  Only rear pointer

  গ

  Both front and rear pointer

  ঘ

  No pointer will be changed
• 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 front pointer

  খ

  Only rear pointer

  গ

  Both front and rear pointer

  ঘ

  No pointer will be changed
• In linked list implementation of a queue, where does a new element be inserted?
  ক

  At the head of link list

  খ

  At the centre position in the link list

  গ

  At the tail of the link list

  ঘ

  At any position in the linked list
• In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
  ক

  Insertion

  খ

  Deletion

  গ

  To empty a queue

  ঘ

  Both Insertion and To empty a queue