CS604 Assignment 2 solution 2019
Vu id: bcxxxxxxxxxxxxxxxxxxx
Username: abc
Q1:
Assume you have to apply shortest job first (SJF) scheduling
algorithms on the set of different process give in the table below.The CPU
burst time is also given for each process .Consider that all the processess
arrive in the ready queu within time 0 seconds except P2 that arrive in ready
queue within 8 seconds.You are required to show the gantt chart to illustrate
the execution serquences of these processes and calculate the total waiting
time and average time for given processes by using SJF Algortihm.
|
Process
|
CPU Burst time (second)
|
|
P0
|
2
|
|
P1
|
6
|
|
P2
|
1
|
|
P3
|
4
|
|
P4
|
3
|
|
P5
|
8
|
Q2:
Consider a scenario where you have to apply round robin
scheduling algorithm on the below give set of processes with each having a
quantum size = 8 milliseconds.The CPU burst time and arrived time for each
process is also provided in the given table.You are required to show the gantt
chart to illustrate the executioin sequences of these processes.moreever,
calculate the average turnaround time and average .Waiting time for given
processes by using round robin algorithm.
|
Process
|
CPU Burst time (second)
|
Arrival time (milliseconds)
|
|
P0
|
15
|
0
|
|
P1
|
8
|
4
|
|
P2
|
25
|
18
|
|
P3
|
18
|
5
|
No comments:
Post a Comment