Question

5. Consider a priority queue of strings with an integer priority. The queue us implemented as a min heap using a 0-based array of size 8 with methods push(entry, priority) and pop(). Determine the priority queue contents, represented both as an array and as a tree, at the points indicated below during the following operations on the ADT. Write down the queue contents after the operation on the given line is executed. 1. priority_queue<string, int> pq; 2. pq.push("start", 10); 3. pq.push("stop", 1); 4. pq.push("pause", 1); 5. pq.push("rewind", 1); 6. pq.pop(); 7. pq.push("stop", 10) 8. pq.pop(); (c) After line 6:

Answer 1

given

1) priority_queue<string,int> pq;

2)pq.push("start",10);

3)pq.push("Stop",1);

4) pq.push("pause",1);

5) pq.push("rewind",1);

6)pq.pop();

7)pq.push("stop",10);

8)pq.pop();

Output of the above program:

rewind,1

start,10

stop,10

//here initially the queue is sorted according to the integer priority after the line six. Then after the first pop() one of the least integral element is removed and then again one more element is inserted.

then after the final pop() again the one with least integral element is removed.