Scribd
Upload
14 views1 page

23MCA114 Operating Systems Assignment 1

Uploaded by

Sowmiya Sowmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
14 views1 page

23MCA114 Operating Systems Assignment 1

Uploaded by

Sowmiya Sowmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

23MCA114 Operating Systems

Assignment 1 – CPU Scheduling

Due Date: 23.10.2023

1. Compare and analyze the FCFS and SJF scheduling algorithms for a set of processes
with the following burst times: P1(10), P2(5), P3(8), P4(12), P5(6). Calculate the
average waiting time and average turnaround time for both algorithms. Discuss the
advantages and disadvantages of each algorithm in this context

2. Consider a system with three processes: P1, P2, and P3, and the following burst times
and priorities:
 P1: Burst time = 4, Priority = 3
 P2: Burst time = 2, Priority = 1
 P3: Burst time = 6, Priority = 4

Apply priority scheduling and calculate the order in which these processes will
execute. Also, compute the waiting time and turnaround time for each process

3. Given a set of processes with burst times: P1(6), P2(4), P3(8), P4(2), P5(7).
Implement the Round Robin scheduling algorithm with a time quantum of 3 units.
Calculate the waiting time and turnaround time for each process. Show the Gantt chart
for the execution.

4. Consider a scenario where priority scheduling is used with aging. Describe the aging
mechanism in detail and how it helps prevent starvation of lower priority processes.
Provide an example to illustrate the concept of aging.
5. A system has three scheduling queues with time quantum values as follows: Queue 1
(RR with 4 ms), Queue 2 (RR with 8 ms), Queue 3 (FCFS). Processes arrive in the
order P1, P2, P3, P4, P5, and each has burst times as follows: P1(6 ms), P2(8 ms),
P3(4 ms), P4(5 ms), P5(7 ms). Simulate the scheduling of these processes and
calculate the waiting time and turnaround time for each process.
6. Investigate and compare CPU scheduling algorithms used in different operating
systems, such as Windows, Linux, and macOS. Analyze the impact of these
algorithms on system performance and responsiveness in real-world scenarios.

You might also like