Database System Concepts
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
Bartleby Related Questions Icon

Related questions

Topic Video
Question
CPU SCHEDULING ALGORITHMS- FIRST COME FIRST SERVE
AIM:
To write a c program to simulate the CPU scheduling algorithm First Come Fir
st Serve (FCFS)
DESCRIPTION:
To calculate the average waiting time using the FCFS algorithm f ist the waitin
g time of the f rst process is kept zero and the waiting time of the second proc
ess is the burst time of the fist process and the waiting time of the third proce
ss is the sum of the burst times of the f ist and the second process and so on.
After calculating all the waitingtimes the average waiting time is calculated as
the average of all the waiting times. FCFS mainly says fist come f ist serve th
e algorithm which came first will be served first.
ALGORITHM:
Step 1: Start the process
Step 2: Accept the number of processes in the ready Queue
Step 3: For each process in the ready Q, assign the process name and the burs
t time
Step4: Set the waiting of the fist process as_0'and its burst time as its turnaro
und time
Step5: for each process in the Ready Q calculate
a). Waiting time (n) = waiting time (n-1) + Burst time (n-1) b).
Turnaround time (n)= waiting time(n)+Burst time(n)
Step 6: Calculate
a) Average waiting time Total waiting Time / Number of process
b) Average Tumaround time Total Turnaround Time / Number of process
Step 7: Stop the process
expand button
Transcribed Image Text:CPU SCHEDULING ALGORITHMS- FIRST COME FIRST SERVE AIM: To write a c program to simulate the CPU scheduling algorithm First Come Fir st Serve (FCFS) DESCRIPTION: To calculate the average waiting time using the FCFS algorithm f ist the waitin g time of the f rst process is kept zero and the waiting time of the second proc ess is the burst time of the fist process and the waiting time of the third proce ss is the sum of the burst times of the f ist and the second process and so on. After calculating all the waitingtimes the average waiting time is calculated as the average of all the waiting times. FCFS mainly says fist come f ist serve th e algorithm which came first will be served first. ALGORITHM: Step 1: Start the process Step 2: Accept the number of processes in the ready Queue Step 3: For each process in the ready Q, assign the process name and the burs t time Step4: Set the waiting of the fist process as_0'and its burst time as its turnaro und time Step5: for each process in the Ready Q calculate a). Waiting time (n) = waiting time (n-1) + Burst time (n-1) b). Turnaround time (n)= waiting time(n)+Burst time(n) Step 6: Calculate a) Average waiting time Total waiting Time / Number of process b) Average Tumaround time Total Turnaround Time / Number of process Step 7: Stop the process
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Computer Science
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
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education