Write the program in either C++ or JAVA to implement a min-heap (priority queue) to schedule real-time processes. The heap should be stored in a fixed-size array of 1,000 records. You must provide functions for inserting or extracting an element in/from the heap.

Every time you insert or extract an element from the heap, you must print:
 
 -The number of levels in the tree traversed to re-heapify (adjust) the tree, as well as
 -The time taken for the entire operation.Your priority queue uses the heap to provide following functions of the priority queue:
·        insert_with_priority: add an element to the queue with an associated priority.
·        pull_highest_priority_element: remove the element from the queue that has the highest priority, and return it.
Finally, you must provide a driver program which reads a file and adds or removes things from the priority queue, as well as a class of scheduled processes. The file has lines that have one of two forms:
 
 -schedule process deadline duration, or
 -run timewhere:
 
 -process is an arbitrary string,
 -deadline, duration, and time represent time.For example, your program might be given a file with the following contents:
schedule sleep 80 80
schedule breakfast 90 5
run 85
schedule email 100 20
run 100
schedule dinner 190 10
schedule lunch 130 5
schedule exercise 180 20
schedule class 150 12
schedule study 120 10
schedule studyAgain 240 30
run 230
run 240


you can think of the first two digits as hours and the last two digits as minutes, so that in this example lunch would be scheduled to complete no later than 13:00 (1pm) and 30 minutes are needed for lunch, whereas homework would be scheduled with a deadline of 23:59 (11:59pm), and 3:00 (three hours) must be allowed to complete the homework.
Each line beginning with schedule tells your program to insert the corresponding item into the priority queue, with a priority corresponding to its deadline. Items with earlier (smaller) deadlines should be executed first -- this is called Earliest Deadline First scheduling, and is often used in real-time systems (you can read about it in Wikipedia if you are interested).


Some suggestions
There are two kinds of time in this program. The heap methods must keep track of how long a method executes. This is actual time or elapsed time is requested from the system clock.

Answer rating: 100% (QA)

ICS 211 Homework 11 Priority Queue assignment In this assignment you implement a minheap use the heap to implement a priority queue and finally use the priority queue to schedule realtime processes Fo... View the full answer