1) Consider a set of process with length of the cpu burst <10,1,2,1,5> and they enter in the same order at time 0. Determine the turn around and waiting time for each process using FCFS and SJF.
2) Describe the essential conditions for deadlock and draw resource allocation graph for following situation:
P={p1,p2,p3} R={r1,r2,r3,r4}
E={p1→r1, p2→r3, r1→p2, r2→p2, r2→p1, r3→p3}
3) Describe about logical versus physical address space with suitable example.
4) How does system detect thrashing and eliminate the same.
5) Describe the acyclic graph directory structure.
6) Describe the FCFS disk scheduling algorithm with an example.
7) Write down and describe the components of LINUX system in detail.
8) Write a detailed note on design principles of WINDOWS NT.
9) Describe the features of a time-sharing system.
10) Describe the creation of a processing system calls in Unix operating system.