adplus-dvertising
frame-decoration

Question

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: (a).FRONT is null

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In linked list implementation of a queue, the important condition for a queue to be empty is?

Similar Questions

Discover Related MCQs

Q. The essential condition which is checked before insertion in a linked queue is?

Q. The essential condition which is checked before deletion in a linked queue is?

Q. With what data structure can a priority queue be implemented?

Q. Which of the following is not an application of priority queue?

Q. What is the time complexity to insert a node based on key in a priority queue?

Q. What is not a disadvantage of priority scheduling in operating systems?

Q. What are the advantages of priority queues?

Q. What is the time complexity to insert a node based on position in a priority queue?

Q. What is a dequeue?

Q. What are the applications of dequeue?

Q. What is the time complexity of deleting from the rear end of the dequeue implemented with a singly linked list?

Q. After performing these set of operations, what does the final list look contain?

InsertFront(10);

InsertFront(20);

InsertRear(30);

DeleteFront();

InsertRear(40);

InsertRear(10);

DeleteRear();

InsertRear(15);

display();

Q. To implement a stack using queue(with only enqueue and dequeue operations), how many queues will you need?

Q. Express -15 as a 6-bit signed binary number.

Q. What is the time complexity for converting decimal to binary numbers?

Q. Which data structure can be used suitably to solve the Tower of Hanoi problem?

Q. Which among the following is not a palindrome?

Q. Which data structure can be used to test a palindrome?

Q. What is the number of moves required in the Tower of Hanoi problem for k disks?