Interested to Buy Any Domain ? << Click Here >> for more details...
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.
4898Post New Wollega University Interview Questions
What are the lotus notes database elements?
What is ms word and features?
What is difference between spring boot and spring mvc? : Spring Boot
What is the best case for bubble sort?
How many partner functions are there in sap ?
What is eclipsed file in clearcase? What is the solution?
SOQL & SOSL? Diff between SOQL & SOSL?
What is csrss exe in task manager?
What is an Email Template?
What does || mean in code?
What is class diagram?
What is Market Measurement and Forecasting...?
Why cant I open a file by its explicit path?
What is graphx spark?
Explain the difference between cross join and full outer join?
