Operating Systems - Easy questions.

Please answer ALL, I will upvote.

11. List different ways to avoid race conditions.

12. What are the advantages and disadvantages of busy-waiting and sleep-and-wake approaches for mutual exclusion?

13. Discuss the goals of CPU scheduling on different computer systems, e.g., batch systems, interactive systems and real-time systems.

14. Assume that the following processes are to be executed on a uniprocessor system. Based on their arrival time and CPU burst, calculate the average turnaround time and response time of these processes under the following scheduling policies:

a. FCFS

b. Round Robin (quantum = 4 and 6)

c. Shortest Job First (preemptive and non-preemptive)

Process Arrival Time CPU burst

P1 0 12

P2 0 3

P3 2 7

P4 3 5

Compare the performance of above policies.