1) Describe in detail about RAID.
2)a) Describe the different operating system services.
b) prepare detailed notes on system programs.
3) Demonstrate how operating system acts as a resource manager.
4)a) Describe about inter process communication.
b) describe the process lifecycles and PCB with suitable illustrations.
5)a) Describe the different multithreading models.
b) Describe about multiple processor scheduling.
6)a) describe the monitor solution for Dining Philosopher problem.
b) Describe the Peterson’s solution for process synchronization.
7)a) Why are segmentation and paging sometimes combined into one scheme?
b) What is the cause of thrashing? How does the system detect thrashing? Once it detects thrashing, what can the system do to eliminate this problem?
c) Describe Bankers algorithm for deadlock avoidance.
8)a) Given five memory partitions of 100kB, 500kB, 200kB, 300kB, and 600kB (in order), how will each of the first-fit, best-fit and worst-fit algorithms place processes of 212kB, 417kB, 112kB, and 426kB (in order)? Which algorithm makes the most efficient use of the memory?
b) prepare brief notes on segmentation.
9) Consider the following page reference string
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
How many page faults will occur for the given replacement algorithms: LRU, FIFO, and Optimal assuming three frames that all frames are initially empty.
10)a) List and describe the different methods for implementing a directory.
b) Describe the different file operations.