Implement the Priority Scheduling algorithm

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
First_Come_First_Serve Sample Code
void calcAvg (int burst_time[4], int waiting_time[4], int turnaround_time[4])
{
int i, j;
int avgwait=0;
int avgTurn=e;
void fcfs(int burst_time[4])
int waiting_time[4];
int turnaround_time[4];
int i,j;
printf("\nProcess\t\tBurst Time\tWaiting Time\tTurnaround Time");
for (i=@; i<4; i++)
waiting_time[@]=e;
//calculating waiting time
for (i=1; i<4; i++)
avgWait += waiting_time[i];
avgTurn += turnaround_time[i];
waiting_time[i]=e;
for (j=0; j<i; j+)
{
waiting_time[i]+=burst_time[j];
printf("\nP[%d]\t\t%d\t\t%d\t\t%d",i,
burst_time[i], waiting_time[i],turnaround_time[i]);
}
printf("\n\nAverage Waiting Time: %.2f", (double)avgwait/4);
printf("\nAverage Turnaround Time: %.2f \n",(double)avgTurn/4);
}
}
//calculating turnaround time
for(i=0; i<4; i++)
{
turnaround_time[i]=burst_time[i]+waiting_time[i];
}
Process
P[0]
P[1]
P[2]
P[3]
Burst Time
Waiting Time
Turnaround Time
6
6
8
6
14
7
14
21
calcAvg (burst_time, waiting_time, turnaround_time);
}
3
21
24
Average Waiting Time: 10.25
Average Turnaround Time:
16.25
Transcribed Image Text:First_Come_First_Serve Sample Code void calcAvg (int burst_time[4], int waiting_time[4], int turnaround_time[4]) { int i, j; int avgwait=0; int avgTurn=e; void fcfs(int burst_time[4]) int waiting_time[4]; int turnaround_time[4]; int i,j; printf("\nProcess\t\tBurst Time\tWaiting Time\tTurnaround Time"); for (i=@; i<4; i++) waiting_time[@]=e; //calculating waiting time for (i=1; i<4; i++) avgWait += waiting_time[i]; avgTurn += turnaround_time[i]; waiting_time[i]=e; for (j=0; j<i; j+) { waiting_time[i]+=burst_time[j]; printf("\nP[%d]\t\t%d\t\t%d\t\t%d",i, burst_time[i], waiting_time[i],turnaround_time[i]); } printf("\n\nAverage Waiting Time: %.2f", (double)avgwait/4); printf("\nAverage Turnaround Time: %.2f \n",(double)avgTurn/4); } } //calculating turnaround time for(i=0; i<4; i++) { turnaround_time[i]=burst_time[i]+waiting_time[i]; } Process P[0] P[1] P[2] P[3] Burst Time Waiting Time Turnaround Time 6 6 8 6 14 7 14 21 calcAvg (burst_time, waiting_time, turnaround_time); } 3 21 24 Average Waiting Time: 10.25 Average Turnaround Time: 16.25
1. Implement the Priority Scheduling algorithm
Similar to FCFS but the order of service follows priority number
Transcribed Image Text:1. Implement the Priority Scheduling algorithm Similar to FCFS but the order of service follows priority number
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY