UGC NET CSE | June 2013 | Part 2 | Question: 30

Question

Consider the following statements for priority queue:

S1: It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations.

S2: The elements of a priority queue may be complex structures that are ordered on one or several fields

• A. Both S1 and S2 are incorrect
• B. S1 is correct and S2 is incorrect
• C. S1 is incorrect and S2 is correct
• D. Both S1 and S2 are correct

Answer 1

Answer : Both S1 and S2 are correct.

statement S1 talks about the intrinsic ordering and it is true because in priority queue we do any operation a/c to the priority of elements.and result of the operation depends on this ordering.

a/c to statement S2 there is no bounding of what kind of element a priority queue should have they may also be complex or simply a list of elements, the only thing should be considered is the  priority of the elements.

Answer 2

I am not sure but I think option C is correct, because for example

min or max heap is the implementation of priority queue, in that order of elements may not decide result of basic operation so s1 is false

s2 is true because heap as priority queue implementation is complex