Definition of priority queue was given. We have to implement the priority queue using array of pointers with the priorities given in the range 1..n. The array could be accessed using the variable top. The list corresponding to the array elements contains the items having the priority as the array index. Adding an item would require changing the value of top if it has higher priority than top. Extracting an item would require deleting the first element from the corresponding queue. The following class was given: class PriorityQueue { int *Data[100]; int top; public: void put(int item, int priority); // inserts the item with the given priority. int get(int priority); // extract the element with the given priority. int count(); // returns the total elements in the priority queue. int isEmpty(); // check whether the priority queue is empty or not. }; We had to implement all these class functions.
4386Post New Wollega University Interview Questions
how to calculate vat,pf,esi,service tax in corporate firm
How can we obtain the generated event?
How can debug share point application and timer jobs? With steps?
Does mongodb run on amazon ebs?
A session S_MAP1 is in Repository A. while running the session error message has displayed `server hot-ws270 is connect to Repository B`.what does it mean?
Explain how you would be an asset to Ralph Lauren?
Will disk cleanup delete my files?
How do you do conditional formatting between two columns?
What is a mvc in medical terms?
What is css3?
What is an example of a data set with a non-gaussian distribution?
How to install and start, stop mysql on valet?
what is user buffer?
How does notification services work?
What are the most important google ranking factors?
