Micro-Project report on

“Make a comparative chart to calculate average waiting time

of different Scheduling algorithms”
Submitted to the

Maharashtra State Board of Technical Education, Mumbai

In partial fulfillment of the requirements for the award of diploma in

Computer Engineering
(V Sem & III Year)

For the subject of

Operating System
(22516)

Submitted by

1) ESHIKA YENURKAR
2) ANTARA RAMDE
3) ASHWINI GUDHADE
4) VAIBHAVI DUSHETWAR

Under the guidance of

(Ms. Harsha Kunwar)

Academic Year 2024-25

DEPARTMENT OF COMPUTER ENGINEERING

G. H. Raisoni Institute of Engineering and Technology

B-37-39/1, Shraddha Park, Hingna ,Wadi Link Road, Nagpur-16
 G. H. Raisoni Institute of Engineering and Technology
Academic Session 2024-25
Department of Computer Engineering

CERTIFICATE

This is to certify that this micro project report on “Make a comparative chart to
calculate average waiting time of different Scheduling algorithms” is the bonafide
work of Eshika Yenurkar, Antara Ramde, Ashwini Gudhade, Vaibhavi
Dushetwar who carried out the project work under my supervision for the partial
fulfillment of the requirement for the award of the degree of the diploma in
Computer Engineering in Fifth semester.

(Ms. Roshani Dharme ) (Ms. Harsha Kunwar)

HOD of CO Department Project Guide

(Dr. G. N. Akhade)
Dean Polytechnic

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION, MUMBAI

 SUBMISSION
We are the students of G. H. Raisoni Institute of Engineering and Technology,
Nagpur (poly), Third year fifth semester of Diploma course of Computer
Engineering humbly submit that we completed time to time as a part of project
work as prescribed Maharashtra State Board of Technical Education, Mumbai for
the subject Operating System and the project is prescribed in the report by our
own skill and study for the academic session 2024-25, as per the guidance of
Ms. Harsha Kunwar, Assistant Professor.

Projectees: Signature of the Projectees

1) ESHIKA YENURKAR

2) ANTARA RAMDE

3) ASHWINI GUDHADE

4) VAIBHAVI DUSHETWAR
CONTENTS

1. Introduction

2. Literature Review

3. Project Planning

4. Data collection and Comparative Study

5. Application

6. Reference
Make a comparative chart to calculate average waiting time
of different Scheduling algorithms
INTRODUCTION
In an operating system, page replacement refers to a scenario in which a page from the main
memory should be replaced by a page from the secondary memory. Page replacement occurs due
to page faults. The various page replacement algorithms like FIFO, Optimal page replacement,
LRU, LIFO, and Random page replacement help the operating system decide which page to
replace.

Course outcomes integrated

CO-516.01: Install operating system and configure it.
CO-516.02: Use operating system tools to perform various functions.
CO-516.03: Execute process commands for performing process management operations.
CO-516.04: Apply scheduling algorithms to calculate turnaround time and average waiting time.
CO-516.05: Calculate efficiency of different memory management techniques.
CO-516.06: Apply file management techniques.

Action Plan

S. Planned Planned Name of Responsible

Details of activity
No. Starts date Finish date Team Members

1 Literature survey 02/09/2024 09/09/2024 1) ESHIKA YENURKAR

2 Work on project 10/09/2024 16/09/2024 2) ANTARA RAMDE
3 Data collection 17/09/2024 24/09/2024
3) ASHIWINI GUDHADE
4 Synopsis Writing 30/09/2024 07/10/2024
5 Submission of project 08/10/2024 15/10/2024 4) VAIBHAVI DUSHETWAR

Resources Required

S. Name of
Specification
N Resource/Material
o.
1 Various books from 1. OS concept By: Silberschatz ,Galvin
library. 2. Operating System By: Godbole , Achyut S.
2 Use of internet 1. www.w3schools.com
2. www.quora.com
Scheduling Algorithms
A scheduling algorithm also called scheduling discipline is an algorithm
used for distributing resources among parties which simultaneously and
asynchronously request them. Scheduling algorithm are used
in operating systems (to share CPU time among
both threads and processes) as well as in routers, disk drives (I/O
scheduling), printers (print spooler), most embedded systems, etc.

The main purposes of scheduling algorithms are to minimize resource

starvation and to ensure fairness amongst the parties utilizing the
resources. Scheduling deals with the problem of deciding which of the
outstanding requests is to be allocated resources. There are many
different scheduling algorithms. In this section, we introduce several of
them.

 First Come First Serve (FCFS)

 Shortest Job First (SJF)
 Priority Scheduling
 Round Robin Scheduling (RR)
1) First Come First Serve (FCFS)

Process Brust Time Arrival Time

P1 7 0
P2 4 1
P3 10 2
P4 6 3
P5 8 4
ANSWER:

Gantt Chart :-

P1 P2 P3 P4 P5
0 7 11 21 27 35

Process Brust Time Arrival Time Waiting Time Turnaround time

P1 7 0 0-0=0 7-0=7
P2 4 1 7-1=6 11-1=10
P3 10 2 11-2=9 21-2=19
P4 6 3 21-3=18 27-3=24
P5 8 4 27-4=23 35-4=31

Average Waiting time = (0+6+9+18+23)/5

=56/5
=11.2 msec

Average Turnaround time = (7+10+19+24+31)/5

=91/5
=18.2 msec
2) Shortest Job First (SJF)

Process Brust Time Arrival Time

P1 7 0
P2 4 1
P3 10 2
P4 6 3
P5 8 4

ANSWER:

1) Non-Preemptive SJF

Gantt Chart :-

P2 P4 P1 P5 P3
0 4 10 17 25 35

Process Brust Time Arrival Time Waiting Time Turnaround time

P1 7 0 10-0=10 17-0=17
P2 4 1 0-1=-1 4-1=3
P3 10 2 25-2=23 35-2=33
P4 6 3 4-3=1 10-3=7
P5 8 4 17-4=13 25-4=21

Average Waiting time = (10-1+23+1+13)/5

=46/5
=9.2 msec

Average Turnaround time = (17+3+33+7+21)/5

=81/5
=16.2 msec
 2) Preemptive SJF

Gantt Chart :-

P1 P2 P1 P4 P5 P3
0 1 5 11 17 25 35

Process Brust Time Arrival Time Waiting Time Turnaround time

P1 7 0 0+5-1=4 1+11-0=12
P2 4 1 1-1=0 5-1=4
P3 10 2 25-2=23 35-2=33
P4 6 3 11-3=8 17-3=14
P5 8 4 17-4=13 25-4=21

Average Waiting time = (4+0+23+8+13)/5

=48/5
=9.6 msec

Average Turnaround time = (12+4+33+14+21)/5

=84/5
=16.8 msec
3) Priority Scheduling
Process Brust Time Priority
P1 7 4
P2 4 1
P3 10 0
P4 6 2
P5 8 3

ANSWER:

Gantt Chart :-

P3 P2 P4 P5 P1
0 10 14 20 28 35

Process Brust Time Priority Waiting Time Turnaround time

P1 7 4 28 35
P2 4 1 10 14
P3 10 0 0 10
P4 6 2 14 20
P5 8 3 20 28

Average Waiting time = (28+10+0+14+20)/5

=72/5
=14.4msec

Average Turnaround time = (35+14+10+20+28)/5

=107/5
=21.5 msec
4)Round Robin Scheduling (RR)
Time Quantum = 4
Process Brust Time
P1 7
P2 4
P3 10
P4 6
P5 8
ANSWER:

Gantt Chart :-

P1 P2 P3 P4 P5 P1 P3 P4 P5 P3
0 4 8 12 16 20 23 27 29 33 35

Process Brust Time Waiting Time Turnaround time

P1 7 0+20=20 4+23=27
P2 4 4 8
P3 10 8+23+33=64 12+27+35=74
P4 6 12+27=39 16+29=45
P5 8 16+29=45 20+33=53

Average Waiting time = (20+4+64+39+45)/5

=172/5
=34.4msec

Average Turnaround time = (27+8+74+45+53)/5

=207/5
=41.4 msec
Comparison Between Various CPU Scheduling Algorithms

Scheduling Algorithms Average Wating Average

Time Turnaround Time
First Come First Serve 11.2 msec 18.2 msec
(FCFS)
Shortest Job First (SJF) 9.2 msec 16.2 msec
Non-Preemptive SJF
Shortest Job First (SJF) 9.6 msec 16.8 msec
Preemptive SJF
Priority Scheduling 14.4 msec 21.5 msec
Round Robin 34.4 msec 41.4 msec
Scheduling(RR)
References
 https://en.m.wikipedia.org/wiki/Scheduling_(computing)
 https://www.quora.com/
 www.w3schools.com