Note : Question number 1 is compulsory. Attempt any three questions from the rest.
Q.1. (a) Draw the Gantt chart for the First Come First Serve (FCFS) scheduling policy and calculate the turnaround time, average waiting time, throughput and processor utilization for the following set of tDrocessesth at arrive at a giuen arriual time shown in the table
| Process |
Arrival time |
Processing time |
| P1 |
0 |
2 |
| P2 |
2 |
2 |
| P3 |
3 |
1 |
| P4 |
5 |
3 |
| P5 |
6 |
4 |
(b) Define paging with the help og a diagram. Explain the principles of operation of paging. Also, discuss about the hardware support for paging.
(c) List and explain all the design issues involved in distributed systems.
(d) Define the Deadlock state. How do we prevent a deadlock using the Havender's Algorithm ? Explain.
Q.2. (a) "The generations of the operating systems are characterised by hardw are component technology, software development and mode of delivery of computer services". Explain all tnte generations of the operating systems w.r.t. the above said parameters.
(b) What is the role of the operating system in providing the security and protection ? Explain any two multilevel models of security.
Q.3. (a) Explain the structure of UNIX operating system. Also, discussth e CPU schedulingin UNIX operating system.
(b) Write and explain the Dekker's solution for Mutual Exclusion.
Q.4. (a) Explain the concept of Thrashing. what are the two available techniques to prevent thrashing ? Explain any one of them.
(b) Explain the Non-continuous (lndexing and chaining) disk space managernent methods.