/* */ Click to Join Live Class with Shankar sir Call 9798158723

Data Structure MCQ - Queue using Linked List


Q1.In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
  1. Insertion
  2. Deletion
  3. To empty a queue
  4. Both a and c

Answer:- (D).
Explanations :Since front pointer is used for deletion, so worst time for the other two cases.
Q2.In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.
  1. AVAIL
  2. FRONT
  3. REAR
  4. None of these

Answer:- (A).
Explanations :All the nodes are collected in AVAIL list.
Q3.In linked list implementation of a queue, the important condition for a queue to be empty is?
  1. FRONT is null
  2. REAR is null
  3. LINK is empty
  4. None of these

Answer:- (A).
Explanations :Because front represents the deleted nodes.
Q4.The essential condition which is checked before insertion in a linked queue is?
  1. Underflow
  2. Overflow
  3. Front value
  4. Rear value

Answer:- (B).
Explanations :To check whether there is space in the queue or not.
Q5.In linked list implementation of a queue, where does a new element be inserted?
  1. At the head of link list
  2. At the centre position in the link list
  3. At the tail of the link list
  4. None of these

Answer:- (C).
Explanations :Since queue follows FIFO so new element inserted at last.
Q6.In linked list implementation of a queue, where does a new element be inserted?
  1. At the head of link list
  2. At the centre position in the link list
  3. At the tail of the link list
  4. At any position in the linked list

Answer:- (C).
Explanations :Since queue follows FIFO so new element inserted at last.
Q7.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?
  1. Only front pointer
  2. Only rear pointer
  3. Both front and rear pointer
  4. No pointer will be changed

Answer:- (B).
Explanations :Since queue follows FIFO so new element inserted at last.
Q8. 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?
  1. Only front pointer
  2. Only rear pointer
  3. Both front and rear pointer
  4. No pointer will be changed

Answer:- (C).
Explanations :Since its the starting of queue, so both values are changed.
Q9.Which of the following is true about linked list implementation of queue?
  1. In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end
  2. In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning
  3. In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from end
  4. In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from beginning

Answer:- (A).
Explanations :It can be done by both the methods.
Q10.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?
  1. Only front pointer
  2. Only rear pointer
  3. Both front and rear pointer
  4. None of the mentioned

Answer:- (B).


«  PREVIOUS PAGE NEXT PAGE »

Copyright © 2022 Shineskill Software Pvt. Ltd., All rights reserved.