Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
=pl1:Display the result according to Table 2 Process PI P2 Arrival Time Burst Time 8 4 45 P3 1 64 P4 6. 4 P5 P6 1 12 16 Table 2 98 P7 37 1) Which Scheduling Algorithm is mentioned in this question? 2) Write and Compile C code of Algorithm mentioned above in Linux. Also displa result according to Table 2. 3) Also draw the Gantt chart of Algorithm according to Table 2 4) Compute and Compare from Table 2 a) Waiting time for all processes b) Average Waiting time

=pl1:Display the result according to Table 2 Process PI P2 Arrival Time Burst Time 8 4 45 P3 1 64 P4 6. 4 P5 P6 1 12 16 Table 2 98 P7 37 1) Which Scheduling Algorithm is mentioned in this question? 2) Write and Compile C code of Algorithm mentioned above in Linux. Also displa result according to Table 2. 3) Also draw the Gantt chart of Algorithm according to Table 2 4) Compute and Compare from Table 2 a) Waiting time for all processes b) Average Waiting time

Computer Networking: A Top-Down Approach (7th Edition)
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...
See similar textbooks
icon
Related questions
Question

Q3 solution needed 

Step3:Initially the waiting time of first short process as 0 and total time of first short is process the service time of that process. Step4:Calculate the total time and waiting time of remaining process. Step5:Waiting time of one process is the total time of the previous process. Step6:Total time of process is calculated by adding the waiting time and service time of each process. Step7:Total waiting time calculated by adding the waiting time of cach process. Step8:Total turnaround time calculated by adding all total time of cach process. Step9:calculate average waiting time by dividing the total waiting time by total number of process. Step10:Calculate average turnaround time by dividing the total waiting time by total number of process. Step11:Display the result according to Table 2 Process Arrival Time Burst Time P1 P2 45 P3 1 64 P4 6. 4 P5 1 P6 12 98 P7 16 37 Table 2 1) Which Scheduling Algorithm is mentioned in this question? 2) Write and Compile C code of Algorithm mentioned above in Linux. Also display result according to Table 2. 3) Also draw the Gantt chart of Algorithm according to Table 2 4) Compute and Compare from Table 2 a) Waiting time for all processes b) Average Waiting time c) Turn Around Time for all processes d) Average Turn Around Time
Transcribed Image Text:Step3:Initially the waiting time of first short process as 0 and total time of first short is process the service time of that process. Step4:Calculate the total time and waiting time of remaining process. Step5:Waiting time of one process is the total time of the previous process. Step6:Total time of process is calculated by adding the waiting time and service time of each process. Step7:Total waiting time calculated by adding the waiting time of cach process. Step8:Total turnaround time calculated by adding all total time of cach process. Step9:calculate average waiting time by dividing the total waiting time by total number of process. Step10:Calculate average turnaround time by dividing the total waiting time by total number of process. Step11:Display the result according to Table 2 Process Arrival Time Burst Time P1 P2 45 P3 1 64 P4 6. 4 P5 1 P6 12 98 P7 16 37 Table 2 1) Which Scheduling Algorithm is mentioned in this question? 2) Write and Compile C code of Algorithm mentioned above in Linux. Also display result according to Table 2. 3) Also draw the Gantt chart of Algorithm according to Table 2 4) Compute and Compare from Table 2 a) Waiting time for all processes b) Average Waiting time c) Turn Around Time for all processes d) Average Turn Around Time
Question Number 2 Below mentioned is an algorithm. Step1:Get the number of process. Step2:Get the id and service time for each process.
Transcribed Image Text:Question Number 2 Below mentioned is an algorithm. Step1:Get the number of process. Step2:Get the id and service time for each process.
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS