Implementation of Priority Scheduling Algorithm in C++

struct process
int no;
int at;
int et;
int wt;
int tt;
int p;

void main()
process p[4];
int i,j;

for(i=0;i<4;i++) { cout<<"\n Enter execution time of P"<>p[i].et;
cout<<"\n Enter Priority P"<>p[i].p;

cout<<"\n PNO\tAT\tET"; for(i=0;i<4;i++) { cout<<"\n P"<

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.