A

MICRO-PROJECT
OF

OPERATING SYSTEM

“MAKE A COMPARATIVE CHART TO CALCULATE

AVERAGE WAITING TIME OF DIFFERENT SCHEDULING
ALGORITHMS”

Submitted in V - semester for partial fulfillment of requirement for

the Diploma in computer engineering of Maharashtra State Board
of Technical Education

Submitted by

Bhavik Jangade Shiban Nandi

Amarpreet Nagi Swapneel Verma

Guided by

Ms. Harsha Kunwar

(Assistant Professor)

DEPARTMENT OF COMPUTER ENGINEERING

G.H. RAISONI COLLEGE OF ENGINEERING & MANAGEMENT,

NAGPUR
2024-2025
G. H. RAISONI COLLEGE OF ENGINEERING & MANAGEMENT,
 NAGPUR

CERTIFICATE

2024-2025
This is Certify that the Entitled

“MAKE A COMPARATIVE CHART TO CALCULATE

AVERAGE WAITING TIME OF DIFFERENT SCHEDULING
ALGORITHMS”
Submitted By

Bhavik Jangade Bhavik Jangade

Amarpreet Nagi Swapneel Verma

Guided By

In V- semester for Partial Fulfillment of Requirement for the Diploma in

Computer Engineering of Maharashtra State Board of Technical Education

Ms. Harsha Kunwar

(Assistant Professor)

Ms. Roshani Dharme Dr. G.N.Akhade

(Head of Department) (Dean Poly)
 SUBMISSION

We, students of fifth semester of third year diploma in computer engineering

humbly submit that we have completed the micro project work as prescribed in
this report by own skill and the study in academic session 2024-25, as per the
instruction and guidance of Ms. Harsha Kunwar
The work carried out in the project is our and not copied the report on any
appreciable part from any other literature in contravention of the academic
ethics.
The teacher has approved our contribution the students associated in the micro-
project are:

Name of Student Sign

1) Shiban Nandi

2) Bhavik Jangade

3) Amarpreet Nagi

4) Swapneel Verma
 ACKNOWLEDGEMENT

We wish to avail this opportunity to acknowledge our profound indebtedness

and extend our deep sense of gratitude of our profound Ms. Harsha Kunwar
for her valuable guidance, advice and encouragement that has been feel to
successful completion of this micro-project.

We hereby express our deep gratitude to our H.O.D. and Hon’ble Principal for
his/her cooperation and help and also the other staff -members of the
department.

We also thank to library for making us available necessary books for reference.
I would like to place on record my sincere thanks to all persons directly or
indirectly helped using completion of this work.
 PART A

Make a Comparative Chart To Calculate Average Waiting Time

Of Different Scheduling
Algorithm
1.0 Brief Introduction
A comparative chart is a useful tool for evaluating and comparing the
performance of different scheduling algorithms in terms of average waiting
time. Scheduling algorithms are used in operating systems to allocate system
resources to different processes or tasks. The average waiting time is an
important metric to evaluate the performance of these algorithms, as it
represents the average time a process waits in the ready queue before it gets
executed.
2.0 Aim of the Micro – Project
This microproject aims at:
1. Make a comparative chart to calculate average waiting time of different
scheduling algorithm.
3.0 Action Plan
Planned Name of
Sr. Planned
Details of activity Finish Responsible
No. Start date
date Team Members
Bhavik Jangade
1 Project Survey 11-9-2024 17-9-2024
2 Gathering Information 18-9-2024 23-9-2024 Shiban Nandi

3 Set up and Configuration 25-9-2024 7-10-2024 Amarpreet Nagi

4 Create Report 9-10-2024 16-10-2024 Swapneel Verma

4.0 Resources Required

S.
No.
Name of Resource / Material Specification Quantity Remark
Computer(Pentium
1 Hardware: Computer System 4th gen), RAM 1 ---------
4GB,HDD 500GB
2 Operating System Windows /LINUX 1 ----------
PART B

Make a Comparative Chart To Calculate Average Waiting Time

Of Different Scheduling
Algorithm
1.0 Brief Description
A comparative chart is a tool used to evaluate and compare the performance of
different scheduling algorithms in terms of average waiting time. It involves
calculating the average waiting time for each algorithm using a set of sample
processes or tasks and presenting the results in a table. The chart allows for a
visual comparison of the average waiting times, enabling the identification of
the algorithm that provides the best performance in terms of waiting time.
2.0 Aim of the Micro – Project
This microproject aims at:
1. Make a comparative chart to calculate average waiting time of different
scheduling algorithm.
3.0 Actual Procedure Followed.
1. Project survey is done by Bhavik Jangade.
2. Gathering information by Shiban Nandi.
3. Set up and configuration is done by Amarpreet Nagi.
4. Creating report is done by Swapneel Verma.

4.0 Actual Resources Used

S. Name of Resource /
Specification Quantity Remark
No Material
.
Computer i3, i5
Hardware: RAM minimum 2GB
1 Computer System and onwards
1 -------
 2 Operating System Windows 1 -------
/LINUX

MAKE A COMPARATIVE CHART TO CALCULATE

AVERAGE WAITING TIME OF DIFFERENT SCHEDULING
ALGORITHMS

 Introduction:

The waiting time of a process in a scheduling algorithm refers to the time it

spends waiting in the ready queue before being executed by the CPU. Different
scheduling algorithms manage process execution in unique ways, resulting in
varying waiting times. Here's a brief overview of the waiting times associated
with common scheduling algorithms:
 First-Come-First-Served (FCFS): Waiting time is directly proportional
to the burst time of the previous processes.
 Shortest Job First (SJF): Waiting time is minimized for shorter
processes, but longer processes may experience longer waiting times.
 Priority Scheduling: Waiting time is influenced by the priority of the
process, with higher-priority processes experiencing shorter waiting
times.
 Round Robin (RR): Waiting time is relatively consistent, as each process
receives a fixed time slice (time quantum).
 Multilevel Feedback Queue (MFQ): Waiting time varies depending on
the queue and time quantum assigned to each process.
Understanding the waiting times of different scheduling algorithms is crucial for
evaluating their performance and selecting the most suitable algorithm for a
specific system or application.
By creating a comparative chart, one would analyze the average waiting time
produced by each algorithm across various scenarios, taking into account
factors like the number of processes, their burst times, and arrival patterns. This
analysis would reveal the strengths and weaknesses of each algorithm in terms
of efficiency and fairness, providing a clear visual representation of their
performance.

 What is CPU Scheduling?

CPU scheduling is a process that allows multiple processes to share the Central
Processing Unit (CPU) time, enabling efficient use of system resources. It's a
crucial feature of operating systems that governs the allocation of processor
time among various tasks running on a computer.

 Why Do We Need CPU Scheduling?

CPU scheduling is needed to efficiently allocate the available processing time of

a CPU among multiple processes that are competing for the CPU's resources.
The need for CPU scheduling arises because modern operating systems allow
multiple processes to execute concurrently on a single CPU. When multiple
processes are running, they contend for the CPU's resources, and the CPU must
choose which process to execute at any given moment.

 What are different scheduling algorithm?

 First-Come, First-Served (FCFS):

 Processes are scheduled in the order they arrive in the ready queue.
 Simple and easy to implement, but can lead to long waiting times,
especially if a long process precedes shorter ones (the "convoy effect").

 Shortest Job Next (SJN):

 Also known as Shortest Job First (SJF), this algorithm selects the process
with the smallest execution time next.
 Minimizes average waiting time but can lead to starvation for longer
processes if shorter ones continuously arrive.

 Round Robin (RR):

 Each process is assigned a fixed time slice (quantum) and is scheduled in
a cyclic order.
 Promotes fairness and responsiveness, particularly for time-sharing
systems, but can increase waiting time if the quantum is too small.

 Priority Scheduling:
 Processes are scheduled based on priority levels; the highest priority
process is executed first.
 Can lead to starvation of lower-priority processes if high-priority tasks
continuously arrive, though variants like aging can mitigate this issue.
  Multilevel Queue Scheduling:
 Divides the ready queue into several separate queues, each with its own
scheduling algorithm.
 Different types of processes can be managed more effectively, but it can
be complex to implement and balance between queues.
 Example of All scheduling algorithms:

Process Arrival Time Burst Time Priority

P1 0 8 1
P2 1 4 4
P3 2 10 2
P4 3 2 3

1) Solving using FCFS:

 Gantt chart:

P1 P2 P3 P4
0 8 12 22 24

 Waiting Time:
P1: 0-0=0
P2: 8-1=7
P3: 12-2=10
P4: 22-3=19
 Average wating time: (0+7+10+19)/4 = 36/4 = 9

2) Solving using SJF:

 Gantt chart:

P4 P2 P1 P3
0 2 6 14 24

 Waiting Time

P1: 6-0=6
P2: 2-1=1
P3: 14-2=12
P4: 0-3= (-3)

 Average waiting time: (6+1+12+(-3))/4 = 16/4 = 4

3) Solving using Priority Scheduling

 Gantt chart

P1 P3 P4 P2
0 8 18 20 24

 Waiting time
 P1:0-0=0
P2:20-1=19
P3:8-2=6
P4:18-3=15

 Average waiting time = (0+19+6+15)/4 = 40/4 = 10

4) Solving using Round Robin (Time quantum = 4)

 Gantt Chart:

P1 P2 P3 P4 P1 P3 P3
0 4 12 16 18 22 26 28

 Waiting time
P1:0+18=18
P2: 4
P3:12+22+26=60
P4: 16

 Average waiting time = (18+4+60+16)/4=98/4 = 24.5

  Comparative Chart

FCFS SJF Priority Round Robin

Waiting Time: Waiting Time: Waiting Time: Waiting Time:

P1:0 P1:6 P1:0 P1:18
P2:7 P2:1 P2:19 P2:4
P3:10 P3:12 P3:6 P3:60
P4:19 P4: (-3) P4:15 P4:16

Average Waiting Average Average Average

Time: 9 Waiting Waiting Waiting
Time: 4 Time :10 Time: 24.5
 CONCLUSION

The conclusion of operating system scheduling algorithms is that they are

critical for the performance and user experience of computer systems.
They help to achieve this by:

 Optimizing CPU utilization: Scheduling algorithms help to maximize

CPU utilization and throughput.

 Ensuring fairness: Scheduling algorithms help to ensure fairness among

processes.

 Adapting to changing workloads: Scheduling algorithms help to adapt

to changing workloads.

 Improving system responsiveness: Scheduling algorithms help to

improve system responsiveness by reducing waiting times, prioritizing
tasks, and optimizing resource utilization.
The choice of scheduling algorithm to use depends on the specific
requirements of the system. Some types of scheduling algorithms include:

 First-Come, First-Served (FCFS)

 Shortest Job Next (SJN)
 Priority Scheduling
 Round Robin
 REFERENCES

1). https://www.geeksforgeeks.org/cpu-scheduling-in-operating-
systems/

2) https://www.baeldung.com/cs/cpu-scheduling-algorithms

3) https://www.tutorialspoint.com/operating_system/index.htm

4). https://www.studytonight.com/lostnfound.php