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.
4400Post New Wollega University Interview Questions
How much of the internet does aws use?
What is kafka Producer?
Sell me this object?
What are T- Bills?
what are constraints? : Sql server database administration
how does a Metro Hub works ?
How to check server status with 'mysqladmin'?
Bearer Capabilities - What are they?
Hi Could someone please provide Siebel Testing Interview questions for 5 years exp.
What are the limitations of Hadoop?
What is jaxr provider?
define the non synchoronism of synchoronous machine in general g or m??
What are hooks in cakephp?
What are advantages and disadvantages of combining the session presentation application layer in the osi model into one single application layer in internet layer?
What are advantages of using LINQ on DataSet?
