Question Number 2 Below mentioned is an algorithm.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

i need solution of Part 3 and 4 

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.
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
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Rod cutting
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education