File Details:

Questions:

1. What is an Operating System? State different types of OS.
2. Explain the different process states with the help of a state diagram.
3. What are the conditions under which a deadlock situation may arise?
4. What are the various Disk-Scheduling Algorithms?
5. Write briefly about file attributes, operations, types, and structure.
6. Discuss in detail about file allocation methods. What are the possible structures for a directory? Discuss them in detail.
7. What is the important feature of the critical section? State the dining philosopher's problem and show how to allocate the several resources among several processes in a deadlock and starvation-free manner.
8. Explain with the help of examples FIFO and LRU, optical page replacement algorithms with example reference string. Mention the merits and demerits of each of the above algorithms.
9. Consider the First Come First Serve (FCFS), Non-Preemptive Shortest Job First (SJF), and Round Robin (RR) scheduling algorithms. Illustrate the scheduling using Gantt chart. Which algorithm will give the minimum average waiting time? Discuss.
10. Construct a Resource Allocation Graph for a given scenario. Will there be a deadlock? If there is a deadlock, discuss the four necessary conditions for deadlock. Else, justify there is no deadlock.
11. With a relevant example, show that the implementation of a semaphore with a waiting queue may result in deadlock.
12. Suppose that the disk drive has 5000 cylinders numbered 0 to 4999. Starting from the current head position, what is the total distance (cylinders) that the disk arm moves to satisfy all the pending requests for each of the disk scheduling algorithms: SSTF, SCAN, LOOK, and C-LOOK?
13. What do you understand by fragmentation? Explain Dynamic Storage-Allocation Problem and segmentation in detail.
14. Explain File System Structure. What are File System Organization and File System Mounting? Discuss the various file allocation methods in detail.