Question

Which of the following is not an advantage of a priority queue?

(a) Easy to implement

(b) Processes with different priority can be efficiently handled

(c) Applications with differing requirements

(d) Easy to delete elements in any case

This is a very interesting question from Priority Queue topic in chapter Abstract Data Types of Data Structures & Algorithms I

I got this question in examination.

Answer 1

The correct answer is (d) Easy to delete elements in any case

For explanation: In worst case, the entire queue has to be searched for the element having the highest priority. This will take more time than usual. So deletion of elements is not an advantage.