L. D.

College of Engineering, Ahmeabad

B.E. 4th SEMESTER
Operating System and Virtulization (3141601)
Assignment – 1
Q.1 Draw process state diagram. Explain each transition among them in detail.
Q.2 What is PCB? List its major fields.
Q.3 Explain the following UNIX commands
(i) grep (ii) cp (iii) chmod (iv) pwd
Q.4 Consider the following set of process with arrival time and burst time. A larger
priority number has a higher priority. Draw the Gantt chart and calculate average
waiting time using Nonpremptive priority scheduling algorithm.
Jobs Arrival Time (ms) Burst Time (ms) Priority
J1 0 6 4
J2 3 5 2
J3 3 3 6
J4 5 5 3
Q.5 Consider the following snapshot of a system:
Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 2 0 0 1 2 1 5 2 0
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using the banker's algorithm:
a. What is the content of the matrix Need?
b. Is the system in a safe state? If yes then what is safe sequence?

Q.6 Following table gives arrival time and expected run time of five processes. Ignore
process switching overhead. Draw the Gantt chart and find average turnaround time
for Round robin (quantum = 2 sec) scheduling algorithm.
Process Expected Run time (in sec.) Arrival Time (in sec.)
A 8 1
B 1 4
C 2 2
D 1 5
E 5 6

Q.7 Explain the classical thread model with its implementation strategies.
Q.8 State and explain the four conditions which must occur to have deadlock in the
system.

*********