COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
FRONT is null
|
|
|
REAR is null
|
|
|
LINK is empty
|
|
|
None of the mentioned
|
Detailed explanation-1: -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-2: -If front and rear both are NULL, it indicates that the queue is empty.
Detailed explanation-3: -Explanation: Since queue follows FIFO so new element deleted from first. 7. In linked list implementation of a queue, the important condition for a queue to be empty is? Explanation: Because front represents the deleted nodes.
Detailed explanation-4: -The Queue implemented using linked list can organize as many data values as we want. In linked list implementation of a queue, the last inserted node is always pointed by ‘rear’ and the first node is always pointed by ‘front’.