Data Structures

1: Which of the following is a collection of items into which items can be inserted arbitrarity and from which only the smallest item can be removed?
A. Descending priority queue
B. Ascending priority queue
C. Fifo queue
D. None of these
 

Answer : B

Explanation :

Name said: (2:37pm on Sunday 23rd March 2014)
The data is stored arbitrarily in the priority queue. But when data is removed in the sequence of- smallest, 2nd smallest, 3rd samllest...etc then it is called ascending priority queue. If data is removed in the sequence- largest, 2nd largest, 3rd largest...etc then it is called descending priority queue.

Write your comments here:


Report Error
 

Option: A

Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here.