COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Underflow
|
|
|
Overflow
|
|
|
Front value
|
|
|
Rear value
|
Detailed explanation-1: -The essential condition which is checked before insertion in a linked queue is? Explanation: To check whether there is space in the queue or not.
Detailed explanation-2: -Explanation: The answer is b, i.e., Underflow. Before deleting an element from the Queue, we first need to check whether the Queue is empty or not.
Detailed explanation-3: -If front and rear both points to NULL, it signifies that the queue is empty. The two main operations performed on the linked queue are: Insertion. Deletion.
Detailed explanation-4: -Correct answer is C 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 end, then in pop operation, nodes must be removed from the beginning.
Detailed explanation-5: -If front and rear both are NULL, it indicates that the queue is empty.