Scribd
Upload
4 views1 page

Assignment 3

The document contains three assignments related to CPU scheduling algorithms. It requires calculations of average waiting time and average turnaround time for processes using FCFS, SJF non-preemptive, and Round Robin scheduling methods. Each assignment provides a set of processes with their arrival and burst times for analysis.

Uploaded by

rk786bd6u
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
4 views1 page

Assignment 3

The document contains three assignments related to CPU scheduling algorithms. It requires calculations of average waiting time and average turnaround time for processes using FCFS, SJF non-preemptive, and Round Robin scheduling methods. Each assignment provides a set of processes with their arrival and burst times for analysis.

Uploaded by

rk786bd6u
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

Assignment No 3

Q.1. Consider the following processes with the burst time (CPU Execution time). Calculate the
average waiting time and average turnaround time by using FCFS scheduling algorithm.
Process id Arrival time Burst time
P1 0 5
P2 1 6
P3 2 7
P4 3 8
P5 4 9

Q.2. Consider the set of 5 processes whose arrival time and burst time are given below. If the
CPU scheduling policy is SJF non-preemptive, calculate the average waiting time and average
turnaround time.
Process id Arrival time Burst time
P1 4 7
P2 0 5
P3 3 4
P4 1 2
P5 2 8

Q.3. Consider the set of 5 processes whose arrival time and burst time are given below. If the
CPU scheduling policy is Round Robin with time quantum = 3 unit, calculate the average
waiting time and average turnaround time.
Process id Arrival time Burst time
P1 1 12
P2 2 5
P3 3 6
P4 4 1
P5 5 3

You might also like