Q. In a circular queue, how do you increment the rear end of the queue?

View solution

Q. What is the term for inserting into a full queue known as?

View solution

Q. What is the time complexity of enqueue operation?

View solution

Q. What is the need for a circular queue?

View solution

Q. What is the space complexity of a linear queue having n elements?

View solution

Q. In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?

View solution

Q. In linked list implementation of a queue, where does a new element be inserted?

View solution

Q. 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?

View solution

Q. 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?

View solution

Q. In case of insertion into a linked queue, a node borrowed from the __________ list is inserted in the queue.

View solution

Q. In linked list implementation of a queue, from where is the item deleted?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. What are the advantages of priority queues?

View solution

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

View solution