To write a c program to simulate the CPU scheduling algorithm First Come Fir st Serve (FCFS)
To write a c program to simulate the CPU scheduling algorithm First Come Fir st Serve (FCFS)
Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter7: File Handling And Applications
Section: Chapter Questions
Problem 7PE
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2ad52e15-34dc-4a37-af22-a638f94bff83%2Fec7f4a5b-5bc5-4eaf-81bb-e88c6d198fc6%2Ffwzh4o1_processed.jpeg&w=3840&q=75)
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
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
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
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
![Microsoft Visual C#](https://www.bartleby.com/isbn_cover_images/9781337102100/9781337102100_smallCoverImage.gif)
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
![C++ for Engineers and Scientists](https://www.bartleby.com/isbn_cover_images/9781133187844/9781133187844_smallCoverImage.gif)
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
![Microsoft Visual C#](https://www.bartleby.com/isbn_cover_images/9781337102100/9781337102100_smallCoverImage.gif)
Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
![Systems Architecture](https://www.bartleby.com/isbn_cover_images/9781305080195/9781305080195_smallCoverImage.gif)
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning