Use a heap to build a data structure known as a 'Priority Queue'.

First, download the driver. Remember, do NOT modify the driver class.

Create a class called Process with the following:

• Instance Variables:
  • priority - an Integer that is used to determine the position within the heap. This will always be greater than 0.
  • time - a Double that represents how long the process will take to run. This will always be greater than 0.
  • name - a String for the name of the process.
• Constructors: Default & Parametrized
• Methods:
  • toString() - A method that returns the name, priority, and time as a String
  • priority() - Getter for the priority
  • time() - Getter for the time
  • name() - Getter for the name

Create another class called ProcessHeap with the following:

• Instance Variables:
  • heap - an array of type Process which represents the heap.
  • size - the number of elements in the heap.
• Constructors: Default
• Other methods:
  • insert(Process process) Insert a new element into the heap. Always adds the next element to the first available spot in the heap `tree' and bubbles it up based on the priority of the Process. Make sure to expand the size of the array if necessary.
    • params
      • process - the Process to add to the heap
  • getMax() Gives the Process with the highest priority.
    • return The Process with the highest priority within the heap.
  • deleteMax() Removes the root of the heap. After this, you must rebalance the heap by moving the last element in the heap to the root, then bubbling it down to the correct location.
    • return The Process with the highest priority within the heap.
  • size() Gives the number of processes left in the queue.
    • return The size of the heap.
  • printHeap() Prints the heap in breadth-order
  • printSorted() Prints out the heap in sorted order. You should use the method discussed in class to create a sorted array of all the Processes, then print out these elements from greatest to least.

        The current heap is:
        e p: 33 t: 23.00
        c p: 20 t: 18.00
        g p: 16 t: 5.00
        b p: 5 t: 20.00
        d p: 18 t: 29.00
        f p: 1 t: 15.00
        a p: 10 t: 50.00
        Current heap in sorted order:
        e p: 33 t: 23.00
        c p: 20 t: 18.00
        d p: 18 t: 29.00
        g p: 16 t: 5.00
        a p: 10 t: 50.00
        b p: 5 t: 20.00
        f p: 1 t: 15.00
        Starting simulation
        Process: e p: 33 t: 23.00 is starting
        Process: e p: 33 t: 23.00 has ended
        Process: c p: 20 t: 18.00 is starting
        Process: c p: 20 t: 18.00 has ended
        Process: d p: 18 t: 29.00 is starting
        Random process added! Random Process p50 p: 10 t: 10.00
        Process: d p: 18 t: 29.00 has ended
        Process: g p: 16 t: 5.00 is starting
        Process: g p: 16 t: 5.00 has ended
        Process: Random Process p50 p: 10 t: 10.00 is starting
        Process: Random Process p50 p: 10 t: 10.00 has ended
        Process: a p: 10 t: 50.00 is starting
        Random process added! Random Process p100 p: 20 t: 20.00
        Process: a p: 10 t: 50.00 has ended
        Process: Random Process p100 p: 20 t: 20.00 is starting
        Random process added! Random Process p150 p: 30 t: 30.00
        Process: Random Process p100 p: 20 t: 20.00 has ended
        Process: Random Process p150 p: 30 t: 30.00 is starting
        Process: Random Process p150 p: 30 t: 30.00 has ended
        Random process added! Random Process p200 p: 40 t: 40.00
        Process: Random Process p200 p: 40 t: 40.00 is starting
        Process: Random Process p200 p: 40 t: 40.00 has ended
        Process: b p: 5 t: 20.00 is starting
        Simulation time has expired
    

Upload the .java file to the dropbox