Scribd
Upload
10 views1 page

SRTF and Round Robin Scheduling Analysis

Uploaded by

Anees
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
10 views1 page

SRTF and Round Robin Scheduling Analysis

Uploaded by

Anees
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

National University of Sciences and Technology

College of Electrical and Mechanical Engineering


Department of Computer & Software Engineering
Assignment-1 [CLO-2]

Max Marks: 10 Due Date: 28th Feb, 2025

Note: Include all steps in your calculations.


No submission is accepted after due date.
Submit solution on LMS.

Question 1: Given the arrival times and CPU-burst times of a set of processes in milliseconds,
explain how you would calculate the average turnaround time and average waiting time using
the Shortest Remaining Time First (SRTF) scheduling algorithm.

Process Arrival Time Burst Time


P1 0 5
P2 1 3
P3 2 3
P4 4 1

Question 2: Given the burst times of 5 processes and a time quantum of 2 units, describe
how you would compute the average waiting time and average turnaround time when the
Round Robin CPU scheduling policy is applied.

Process Id Burst time


P1 5
P2 3
P3 1
P4 2
P5 3

You might also like