Untitled
unknown
plain_text
9 months ago
1.4 kB
3
Indexable
import java.util.*; class PriorityNP { public static void main(String[] args) { Scanner sc=new Scanner(System.in); System.out.println("Enter the no. of Parameters"); int n=sc.nextInt(); int pid[]=new int[n]; int at[]=new int[n]; int bt[]=new int[n]; int ct[]=new int[n]; int tat[]=new int[n]; int wt[]=new int[n]; int f[]=new int[n]; int btt[]=new int[n]; int prio[]=new int[n]; for(int i=0;i<n;i++) { System.out.println("Enter the process id:"); pid[i]=sc.nextInt(); System.out.println("Enter the arrival Time:"); at[i]=sc.nextInt(); System.out.println("Enter the Burst time:"); bt[i]=sc.nextInt(); btt[i]=bt[i]; System.out.println("Enter Priority Time:"); prio[i]=sc.nextInt(); f[i]=0; } sc.close(); int st=0; int total=0; //int i=0; while(true) { if(total==n) break; int c=n; int min=99; for(int i=0;i<n;i++) { if(at[i]<=st&&f[i]==0&&prio[i]<min) { c=i; min=prio[i]; } } if(c==n) { st+=1; } else { ct[c]=st+bt[c]; f[c]=1; st=ct[c]; total++; } } for(int k=0;k<n;k++) { tat[k]=ct[k]-at[k]; wt[k]=tat[k]-bt[k]; } for(int j=0;j<n;j++) { System.out.println(pid[j]+"\t"+at[j]+"\t"+btt[j]+"\t"+prio[j]+"\t"+ct[j]+"\t"+tat[j]+"\t"+wt[j]); } } }
Editor is loading...
Leave a Comment