Scribd
Upload
197 views

OS Assignment 2

This document outlines an assignment on CPU scheduling algorithms. It includes 4 questions asking the student to: 1) Draw Gantt charts and calculate metrics for FCFS, SJF, RR, and priority scheduling on sample processes. 2) Draw Gantt charts for preemptive and non-preemptive priority scheduling on another sample. 3) Draw Gantt charts, calculate turnaround and waiting times, and determine the best algorithm for another set of sample processes using FCFS, SJF, priority, and RR scheduling. 4) Schedule two more sample process sets using multi-level queue and multi-level feedback queue approaches and calculate average waiting and turnaround times.

Uploaded by

Tactician VXP
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
197 views

OS Assignment 2

This document outlines an assignment on CPU scheduling algorithms. It includes 4 questions asking the student to: 1) Draw Gantt charts and calculate metrics for FCFS, SJF, RR, and priority scheduling on sample processes. 2) Draw Gantt charts for preemptive and non-preemptive priority scheduling on another sample. 3) Draw Gantt charts, calculate turnaround and waiting times, and determine the best algorithm for another set of sample processes using FCFS, SJF, priority, and RR scheduling. 4) Schedule two more sample process sets using multi-level queue and multi-level feedback queue approaches and calculate average waiting and turnaround times.

Uploaded by

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

Assignment 2 CSE-C

CPU Scheduling

Deadline: - 20-02-23

1. For processes listed in table, draw a chart illustrating their execution using (a) FCFS
(b) SJF and Preemptive SJF (Shortest Remaining time first)
(c) RR (TQ-2) (d) RR(TQ-1)
Also calculate average turnaround time, average wait time and average waiting time for each
algorithm.

Process Arrival Time Processing


Time
A 0 3
B 1.001 6
C 4.001 4
D 6.001 2

2. For the process listed in table below, draw a chart illustrating their execution using preemptive
non preemptive priority scheduling. A larger priority number has higher priority.

Process Arrival Time Burst Priority


A 0 4 3
B 1.0001 3 4
C 2.0001 3 6
D 3.0001 5 5

3. Consider the following set of processes, with the length of the CPU-burst time given in
milliseconds:

Process Burst Time Priority


P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.
a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF,
a nonpreemptive priority (a smaller priority number implies a higher priority), and RR
(quantum = 1) scheduling.
b. What is the turnaround time of each process for each of the scheduling algorithms in
part a?
c. What is the waiting time of each process for each of the scheduling algorithms in part
a?
d. Which of the schedules in part a result in the minimal average waiting time (over all
processes)?
4. Consider the following set of processes, with the length of the CPU-burst time given in
milliseconds:
Arrival time Burst Time Priority Process Type
P1 0 7 1 System
P2 3 8 2 Interactive
P3 5 2 1 System
P4 9 12 5 System
P5 0 2 2 Interactive
P6 2 3 1 Others

Schedule the above process as per following algorithm and find the Average waiting and TAT time.

a. Multi-level queue
System Queue – P-SJF
Interactive – RR-2
Others –FCFS

b. Multi-level feedback queue


Q1 RR-4
Q2 P-SJF
Q3 FCFS

You might also like