JAVA HOMEWORK Process Heap Objective: Create a couple of classes that will simul
ID: 645649 • Letter: J
Question
JAVA HOMEWORK
Process Heap
Objective:
Create a couple of classes that will simulate a process heap. Download the DRIVER and follow the following instructions!
Create a class called Process
Instance variables:
Priority: which is an integer value that corresponds to where it will be in the heap. Needs to be greater than 0.
Time: A double value that corresponds to how long the process will take to run. Needs to be greater than 0.
Name: A string value that is the name of the process
Constructors: Default and Parameterized
Accessors and mutators for each instance variable
Make sure to check for valid values.
Other methods:
toString: a method that prints out the name, priority, and time
Create another class called ProcessHeap
Instance variables:
Heap: an array of type Process which represents the heap
Size: the number of elements in the heap
Constructors: Default and parameterized
Other methods:
insert: this method which returns nothing adds a new element to the heap. It always adds the next element as the next element in breadth order and then bubbles it up based on the priority of the Process.
peek: this returns the head of the heap
remove: This returns the root of the heap and then removes it from the heap. It must then move the last element in the heap (via breadth order) to the root and bubble that value down until its in the correct location.
printHeap: Prints the heap out in breadth order
isEmpty: returns a true or false value for whether or not the queue is empty
heapSort: Prints out the heap in sorted order. The idea is to remove an element print that element and then repeat that until there are no more elements.
Example Print Out:
The current heap is:
e 33 23.0
c 20 18.0
d 18 29.0
g 16 5.0
b 5 20.0
f 1 15.0
a 10 50.0
Starting simulation
Process: e 33 23.0 is starting
Process: e 33 23.0 has ended
Process: c 20 18.0 is starting
Process: c 20 18.0 has ended
Process: d 18 29.0 is starting
Random process added! Random Process 50 10 10.0
Process: d 18 29.0 has ended
Process: g 16 5.0 is starting
Process: g 16 5.0 has ended
Process: a 10 50.0 is starting
Random process added! Random Process 100 20 20.0
Process: a 10 50.0 has ended
Process: Random Process 100 20 20.0 is starting
Random process added! Random Process 150 30 30.0
Process: Random Process 100 20 20.0 has ended
Process: Random Process 150 30 30.0 is starting
Process: Random Process 150 30 30.0 has ended
Process: Random Process 50 10 10.0 is starting
Process: Random Process 50 10 10.0 has ended
Random process added! Random Process 200 40 40.0
Process: Random Process 200 40 40.0 is starting
Process: Random Process 200 40 40.0 has ended
Process: b 5 20.0 is starting
Simulation time has expired
DRIVER:
Explanation / Answer
class Process{
private int priority;
private double time;
private String name;
public Process(){
priority=0;
time=0.0;
name="";
}
public Process(int priority,double time,String name){
this.priority=priority;
this.time=time;
this.name=name;
}
public int getPriority(){
return priority;
}
public void setPriority(int p){
priority=p;
}
public double getTime(){
return time;
}
public void setTime(double t){
time=t;
}
public String getName(){
return name;
}
public void setName(String n){
name=n;
}
public String toString(){
String str=" Name: "+name;
str+=" Priority: "+priority;
str+=" Time: "+time;
return str;
}
}
class ProcessHeap{
private Process[] heap;
private int size;
private static int counter=0;
public ProcessHeap(){
heap=null;
size=0;
}
public ProcessHeap(Process[] heap,int size){
this.heap=heap;
this.size=size;
}
public void insert(Process p){
heap[counter++]=p; //insert a process into the heap
}
public Process peek(){
return heap[counter-1]; //returns the head of the heap
}
public Process remove(){
Process temp=heap[0];
for(int i=0;i<counter-1;i++){
heap[counter]=heap[counter+1];
}
return temp;
}
public void printHeap(){
for(int i=0;i<counter;i++){
System.out.println(heap[i].toString());
}
}
public bool isEmpty(){
if(counter==0){
return true;
}else{
return false;
}
}
public void heapSort(){
Process temp=null;
for(int i=0;i<counter-1;i++){
for(int j=0;j<counter-i-1;j++){
if(heap[j].getPriority()>heap[j+1].getPriority()){ //sort the heap processes based on their priority
temp=heap[j];
heap[j]=heap[j+1];
heap[j+1]=temp;
}
}
}
printHeap();
}
}
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.