Question

Write a java program that represents a preemptive low priority scheduler, and calculate the waiting time for each process. Low priority means that the low the number the higher the priority. Also assume that processes can arrive at different times. Hint: Use a priority queue.

Answer 1

Language Java 6 Run Debug Stop Share Save {}Beautify Main.java 1 import java.util.Scanner; 2 public class Main 3-{ public static void main(Strin [] args) { int i, j,pos; int[] arivaltime, priority, bursttime, waitingTime; System.out.println("enter the number of process"); Scanner in=new Scanner(System.in); int a= in.nextInt(); arivaltime = new int[a]; priority= new int[a]; waitingTime= new int[a]; System.out.println("enter the arivalTime for each process"); for (i=0;i<a;i++) { arivaltime[i]= in.nextInt(); System.out.println("enter the priority for the each process"); NNNUD for(i=0;i<a;i++) { priority[i]= in.nextInt(); bursttime= new int[a]; System.out.println("enter the bursttime for the each process"); for (i=0;i<a; i++){ bursttime[i]=in.nextInt(); intilococessName. input

Run Debug Stop Share Save } Beautify Language Java Main.java 38 39 int[] processName; processName=new int[a]; for(i=1;i<a+1;i++){ processName[i-1]=i; // main logic start from here........ int time; for(i=0;i<a;i++) pos=i; for(j=i+1;i<a; i++) { if(priority[j]>priority[pos]){ pos=j; time priority[i]; priority[i]=priority[pos]; priority[pos] =time; time=bursttime[i]; bursttime[i]=bursttime [pos]; bursttime[pos]=time; waitingTime[0]=0; System.out.println("procsstburst time t priority \t waitingTime\n"); for(i=0;i<a ;i++) waitingTime[i]=0; for(j=0; j<i; j++){ waitingTime[i] waitingTime[i]+bursttime[j]; System.out.println(i+1+' t'+bursttime[i]+'\t'+priority[i]+'\t'+waitingTime[i]+"\n");
In this answer i solve it in non-premative approch....

I learn lot of things for that...