Operating System Unit 2

1. Write about the various CPU scheduling algorithms.
2. What is critical section problem and explain two process solutions and multiple
process solutions?
3. Explain what semaphores are, their usage, implementation given to avoid busy
waiting and binary semaphores.
4. Explain about critical regions and monitors
5. Explain the various classic problems of synchronization
6. Write note on TSL and SWAP instruction SASURIE ACADEMY OF ENGINEERING
 7. Give a detailed description about deadlocks and its characterization
 8. Explain about the methods used to prevent deadlocks
9. Explain the Banker’s algorithm for deadlock avoidance.
10. Consider the following set of processes, with the length of the CPU-burst time
given in milliseconds:
Process Burst Time Priority
1. P1 10 3
2. P2 1 1
3. P3 2 3
4. P4 1 4
5. P5 5 2
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at
time 0.
a. Draw four Gantt charts 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. (4)
b. What is the turnaround time of each process for each of the scheduling
algorithms in part a? (4)
c. What is the waiting time of each process for each of the scheduling
 algorithms in Part a? (4)
d. Which of the schedules in part a results in the minimal average waiting
 time (over all processes)? (4)