Index

Sr. No. Contents Page No.

Annexure I– Micro Project Proposal 1-3

1.Aims/Benefits of the Micro-Project 1

2. Course Outcome Addressed 1

1 3.Proposed Methodology 1

4. Action Plan 2

5. Resources Required 2

6. Name of Team Members with Roll No.’s 3

Annexure II – Micro Project Report 4-7

1.Rationale 4

2.Aims/Benefits of the Micro-Project 4-5

3.Course Outcome Achieved 5

2
4. Literature Review 5

5.Actual Methodology Followed 6

6.Actual Resources Used 6

8. Skill developed / Learning out of this Micro-Project 7

9. Applications of this Micro-Project 7

i
 Annexure I

Micro Project Proposal

CPU Scheduling Algorithms

1. Aims/Benefits of the Micro-Project:

1. Deep Understanding: It helps you understand core concepts of CPU

scheduling, which is essential for efficient resource management in operating
systems.
2. Practical Application: Implementing algorithms like FCFS, SJF, RR, and
Priority Scheduling gives hands-on experience, reinforcing theoretical
knowledge with practical skills.
3. Performance Analysis: You learn to compare and analyze different scheduling
strategies based on performance metrics like waiting time and turnaround
time, which is crucial for optimizing system processes.

2. Course Outcome Addressed:

 Apply scheduling algorithms to calculate turnaround time and average waiting

time

3. Proposed Methodology:

 Problem Identification: Identify the need for efficient CPU scheduling to

manage multiple processes in an operating system.
 Research: Study scheduling algorithms (FCFS, SJF, RR, Priority) and key
performance metrics (waiting time, turnaround time).
 Algorithm Design: Plan the implementation of each algorithm, specifying
inputs (arrival, burst time) and outputs (scheduling order, performance
metrics).
 Implementation: Code the algorithms using a programming language like C,
Java, or Python, ensuring accurate scheduling and output generation.

1
4. Action Plan:

Sr. Planned Planned Name of Responsible

Details of Activity
No. Start date Finish date Team Members
1 Search the topic 09/01/24 15/01/24
1:00-3:00 PM 1:00-3:00 PM
2 Collect the information 17/01/24 23/01/24
1:00-3:00 PM 1:00-3:00 PM
3 Analysis of information 24/01/24 31/01/24
and instruction 1:00-3:00 PM 1:00-3:00 PM Raghav Sunil
4 Write the source code of 05/02/24 13/02/24 Deshpande
project 1:00-3:00 PM 1:00-3:00 PM
5 Get the snapshot of 14/02/24 20/02/24
project 1:00-3:00 PM 1:00-3:00 PM
6 Making index and 21/02/24 27/02/24
certificate of the project 1:00-3:00 PM 1:00-3:00 PM
7 Finalizing project with its 06/03/14 13/03/24
report 1:00-3:00 PM 1:00-3:00 PM
8 Presentation and Feedback 18/03/24 27/03/24
1:00-3:00 PM 1:00-3:00 PM

5. Resources Required:
Sr.
No Name of resource / material Specification Quantity Remarks
.
1 Computer WINDOWS 10, 2GB 1 ok
RAM, 160GB HDD
2 Operating System WINDOWS 10 1 ok
4 Browser Google Chrome 1 ok

2
6. Name of Team Members with Roll No.’s:
Sr.
Enrollment No. Name of Team Member Roll No.
No.
1. 2210950223 Raghav Sunil Deshpande 36

Mr. Chavan A Y

Name and Signature of the Teacher

3
 Annexure – II

Micro-Project Report

CPU Scheduling Algorithms

1. Rationale:

 The rationale behind this microproject on CPU scheduling algorithms is to

gain a deeper understanding of how operating systems manage multiple
processes efficiently. Scheduling plays a vital role in optimizing CPU
utilization, reducing waiting time, and improving system performance in
multitasking environments. By exploring various algorithms—such as FCFS,
SJF, Round Robin, and Priority Scheduling—you can learn the strengths and
weaknesses of each and their practical applications.

 This project helps bridge the gap between theoretical knowledge and real-
world system challenges, providing hands-on experience in implementing and
analyzing scheduling strategies. Understanding these algorithms is crucial for
optimizing resource management in modern computing environments like
servers, real-time systems, and cloud platforms.

2. Aims/Benefits of the Micro-Project:

1. Deep Understanding: It helps you understand core concepts of CPU

scheduling, which is essential for efficient resource management in operating
systems.
2. Practical Application: Implementing algorithms like FCFS, SJF, RR, and
Priority Scheduling gives hands-on experience, reinforcing theoretical
knowledge with practical skills.

4
 3. Performance Analysis: You learn to compare and analyze different scheduling
strategies based on performance metrics like waiting time and turnaround
time, which is crucial for optimizing system processes.

3. Course Outcomes Achieved:

 Apply scheduling algorithms to calculate turnaround time and average waiting

time

4. Literature Review:
CPU scheduling algorithms play a crucial role in managing processes efficiently in
operating systems. Various algorithms have been developed, each suited for different
system needs.

1. First-Come-First-Serve (FCFS)

FCFS is the simplest scheduling algorithm, executing processes in the order they
arrive. However, it suffers from the convoy effect, where long processes delay shorter
ones, making it inefficient for interactive systems (Stallings, 2018).

2. Shortest Job First (SJF)

SJF minimizes average waiting time by selecting the shortest process first. Although
it performs optimally in theory, it requires knowledge of burst times and can cause
starvation of longer processes (Silberschatz et al., 2013).

3. Round Robin (RR)

RR is designed for fairness and responsiveness, especially in time-sharing systems. It

provides equal CPU time to processes but requires careful tuning of the time quantum
to balance performance and context switching overhead (Tanenbaum, 2007).

4. Priority Scheduling

Priority scheduling executes processes based on their priority levels. While effective
for handling critical tasks, it can cause starvation of lower-priority processes, which
can be mitigated by aging (Silberschatz et al., 2013).

5
5. Comparative Analysis

Studies show that SJF minimizes waiting time, RR ensures fairness, and Priority
scheduling efficiently manages critical tasks but may lead to starvation. The choice of
algorithm depends on the specific system goals (Rajput & Gupta, 2012).

5.Actual Methodology Followed:

1. Problem Definition: Identified the need to evaluate different CPU scheduling

algorithms for efficient process management.

2. Research and Study: Studied algorithms like FCFS, SJF, Round Robin, and
Priority Scheduling, along with performance metrics such as waiting time and
turnaround time.

3. Algorithm Design: Developed flowcharts and pseudocode for each algorithm,

outlining inputs (arrival time, burst time, etc.) and outputs (waiting time,
scheduling order).

4. Implementation: Coded the algorithms in a programming language and

simulated real-time process execution.

6. Actual Resources Used:

Sr. Name of resource /

Specification Quantity Remarks
No. material

1 Computer WINDOWS 10,2GB 1 ok

RAM, 160GB HDD
2 Operating System WINDOWS 10 1 ok

4 Browser Google Chrome 1 ok

6
 7.Skill developed / Learning out of this Micro-Project:

1. Understanding of Scheduling Algorithms: Gained a deep understanding of

CPU scheduling algorithms like FCFS, SJF, Round Robin, and Priority
Scheduling, along with their practical applications and limitations.
2. Implementation Skills: Enhanced programming skills by implementing the
scheduling algorithms, applying logic, and simulating real-world
scenarios.
3. Performance Analysis: Learned how to evaluate and compare algorithms
based on key metrics such as waiting time, turnaround time, and response
time, and how these affect overall system performance.
4. Problem-Solving Abilities: Developed problem-solving skills by
addressing challenges such as process starvation in priority scheduling and
the convoy effect in FCFS.

8. Applications of this Micro-Project:

 Operating Systems: Scheduling algorithms are fundamental in operating

systems like Windows, Linux, and macOS for managing process
execution, ensuring fairness, and maximizing CPU utilization.

 Cloud Computing: In cloud environments, efficient scheduling ensures

optimal resource allocation, balancing workloads across servers and
reducing latency.

 Batch Processing: FCFS and SJF are commonly used in batch processing
systems where tasks are executed sequentially or based on shortest
processing time to maximize throughput.

 Embedded Systems: Scheduling is vital in embedded systems to ensure

timely execution of tasks in devices like cars, appliances, and mobile
phones.