Operating System Assessment 2022

Operating System
T1 2019: ICT201 Computer Organization and Architecture
Assessment 1
1

Operating System
Table of Contents
CPU Scheduling 1
Scheduling turn around and waiting time 2
Deadlock 3
Deadlock detection 4
Resource Allocation graph 5
References 6
2

Operating System
Assignment Details:
1- Given the following arrival times and CPU cycle times.
Draw a timeline for each of the following scheduling algorithms and also show the details of the
ready queue formation during the timeline. (5 marks each)
i FCFS
ii SJN
iii SRT
Iv Round Robin (use time quantum of 3)
1. FCFS (First come First Serve )
As the name suggests this scheduling algorithm works on the concept , that the process which
arrives first is served first. It can be stated that the process which requests the process first , gets
the allocated the CPU first.
It works on the concept of the First in First out (FIFO) , queue data structure the element which
enters in the queue first leaves the queue first.
Ready Queue Formation
T
i
m
e
0 1 2 3 4 5 6 7 8 9 1
0
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
2
0
2
1
2
2
2
3
2
4
2
5
2
6
2
7
2
8
2
9
3
0
R
u
n
n
i
n
g
A
.
1
2
A
.
1
1
A
.
1
0
A
.
1
0
A
.
9
A
.
8
A
.
7
A
.
6
A
.
5
A
.
4
A
.
3
A
.
2
A
.
1
B
.
4
B
.
3
B
.
2
B
.
1
C
.
2
C
.
1
D
.
1
1
D
1
0
D
9
D
8
D
7
D
6
D
5
D
4
D
3
D
2
D
1
E
1
3
Job Arrival Time CPU cycles
required
A 0 12
B 2 5
C 4 2
D 6 11
E 9 1

Operating System
st
a
t
e
J
o
b
R
e
a
d
y
st
a
c
k
1
(
T
O
P
)
.
B
B
.
4
B
.
3
B
.
2
B
.
1
C
.
2
C
.
1
D
.
1
1
D
.
1
0
D
.
9
D
.
8
D
.
7
D
.
6
D
.
5
D
.
4
D
.
3
D
.
2
D
.
1
E
.
1
.
C
C
.
2
C
.
1
D
.
1
1
D
.
1
0
D
.
9
D
.
8
D
.
7
D
.
6
D
.
5
D
.
4
D
.
3
D
.
2
D
.
1
E
.
1
.
D
D
.
1
1
D
.
1
0
D
.
9
D
.
8
D
.
7
D
.
6
D
.
5
D
.
4
D
.
3
D
.
2
D
.
1
E
.
1
F
i
n
is
h
st
a
c
k
A B C D E
.
B
B
.
4
B
.
3
B
.
2
B
.
3
B
.
1
C
.
2
C
.
1
D
.
1
D
.
1
D
.
9
D
.
8
D
.
7
D
.
6
D
.
5
D
.
4
D
.
3
D
.
2
D
.
1
E
.
1
4