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

Q. What is a dequeue?

View solution

Q. What are the applications of dequeue?

View solution

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

View solution

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();

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Which among the following is not a palindrome?

View solution

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

View solution

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

View solution