List and explain the various features of operating system.
Describe the evolution of operating system in detail.
Discuss the various services provided by operating system.
Explain the Peterson solution for critical section problem.
Consider the following set of process, with the length of the CPU burst given in milliseconds. Process | Burst Time | Priority P1 | 10 | 3 P2 | 1 | 1 P3 | 2 | 3 P4 | 1 | 4 P5 | 5 | 2 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Calculate the turnaround time of each process by applying priority scheduling algorithm.
Write and explain the Banker's algorithm for deadlock avoidance.
Discuss the advantage of segmentation over paging.
Explain in brief the need of demand paging.
Define Belady's anomaly. Why does Belady's anomaly happen explain with an example?
Suppose the head of a moving head disk with 200 tracks, numbered 0 to 199, is currently serving a request at track 143 and has just finished a request at track 125. If the queue of requests is kept in FIFO order: 86, 147, 91, 177, 94, 150, 102, 175, and 130. What is the total head movement to satisfy these requests for the FCFS disk scheduling algorithms?
Explain the following with relevant diagrams: Two level directory structure
Explain the following with relevant diagrams: Acyclic-graph directory structure
Discuss in brief the logical structure of I/O function.
Explain the interrupt driven I/O techniques.
Discuss in brief any of the following: a) User level and kernel level threads b) Virtual memory c) Tape organization d) I/O Buffering
