PART-A 1)What is process? 2) What are different state of process? 3) Sketch process state transition diagram?

4) Explain process control block ?

5) What is context switching? 6) What is CPU schedulers ? 7) What are different type of schedulers ? 8) Explain mid-term schedulers ? 9) Explain short -term schedulers? 10) Explain long-term schedulers? 11) Explain performance criteria for the selection of schedulers ? 12) Explain in brief evolution method for CPU scheduling algorithm ? 13) Explain FCFS CPU scheduling algorithm? 14) Explain SJF CPU scheduling algorithm? 15) Explain SRTM scheduling algorithm? 16) Explain priority based non preemptive scheduling algorithm? 17) Explain priority based preemptive scheduling algorithm? 18) Explain robin round scheduling algorithm? 21) Define deadlock

22) What are conditions under which a deadlock situation may arise? 23) What is a resource-allocation graph 24) What are the methods for handling deadlocks 25) Define deadlock prevention 26) What are a safe state and an unsafe state

PART-B 16 mark
1.

1 Consider the following set of processes, with the length of CPU-burst time given in
millisecond: Process P1 P2 P3 P4 P5 Burst time 10 1 2 1 5 Priority 3 1 3 4 2

The processes are assumed to have arrived in order P1, P2, P3, P4, P5 all at time 0. (i) Draw Gantt chats illustrating the execution of these processes using FCFS, SJF, a non-preemptive priority ( a smaller priority number implies a higher priority) and RR (quantum=1) scheduling (ii) What is the turnaround time of each process for each of the scheduling algorithms in part (i)? [12] 2. An operating system contains three resource classes, namely R1, R2 and R3. The number of resource units in these classes is 7, 7 and 10 respectively. The current resource allocation state is as shown below : Process Allocated Resources R1 2 2 1 R2 2 0 2 R3 3 3 4 Maximum Requirement R1 3 4 3 R2 6 3 4 R3 8 3 4 [3] [3] [3]

P1 P2 P3

(i) Is the current allocation state safe? (ii)Would the following requests be granted in the current state? (1) Process P1 requests (1, 1, 0) (2) Process P3 requests (0, 1, 0) (3) Process P2 requests (0, 1, 0)

3)Assume that following jobs have arrived in the order 1,2,3,4 and 5: Job Arrival Time Burst Time Priority 1 0 15 2 2 2 3 1 3 5 5 5 4 6 8 4 5 7 12 3 Give Gantt chart and calculate Avg. Turnaround Time and Waiting Time for: i) FCFS ii) Preemptive priority algorithm

4)Consider the following set of process with the length of CPU burst time in milliseconds:Process Burst Time Priority P1 7 3 P2 9 2 P3 2 1 P4 1 4 P5 3 5 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 and all at time 0. a) Draw Gantt chart, illustrating the execution of these processes using FCFS, SJF, preemptive priority and RR (quantum = 1) scheduling.

5)Give a detailed description about deadlocks and its characterization 6) Explain about the methods used to prevent deadlocks 7) Write in detail about deadlock avoidance. 8) Explain the Bankers algorithm for deadlock avoidance. 9) Give an account about deadlock detection. 10) What are the methods involved in recovery from deadlocks?