MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 12 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following is true about linked list implementation of queue? |
| A. | In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end |
| B. | In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning |
| C. | In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from end |
| D. | In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from beginning |
| Answer» B. In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning | |
| 2. |
The essential condition which is checked before deletion in a linked queue is? |
| A. | Underflow |
| B. | Overflow |
| C. | Front value |
| D. | Rear value |
| Answer» B. Overflow | |
| 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? |
| 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 | |
| 4. |
THE_ESSENTIAL_CONDITION_WHICH_IS_CHECKED_BEFORE_DELETION_IN_A_LINKED_QUEUE_IS??$ |
| A. | Underflow |
| B. | Overflow |
| C. | Front value |
| D. | Rear value |
| Answer» B. Overflow | |
| 5. |
Which of the following is true about linked list implementation of queue?$ |
| A. | In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation, nodes must be removed from end |
| B. | In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning |
| C. | In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from end |
| D. | None of the mentioned |
| Answer» B. In push operation, if new nodes are inserted at the beginning, then in pop operation, nodes must be removed from the beginning | |
| 6. |
The essential condition which is checked before insertion in a linked queue is? |
| A. | Underflow |
| B. | Overflow |
| C. | Front value |
| D. | Rear value |
| Answer» C. Front value | |
| 7. |
In linked list implementation of a queue, the important condition for a queue to be empty is? |
| A. | FRONT is null |
| B. | REAR is null |
| C. | LINK is empty |
| D. | None of the mentioned |
| Answer» B. REAR is null | |
| 8. |
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. | None of the mentioned |
| Answer» B. At the centre position in the link list | |
| 9. |
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. | None of the mentioned |
| Answer» B. FRONT | |
| 10. |
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. | None of the mentioned |
| Answer» C. Both front and rear pointer | |
| 11. |
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. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 12. |
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 |
| Answer» E. | |