File Details:

Questions:

1. Define operating systems and discuss its role from different perspectives.
2. Write short notes on Simple Batch Systems and Parallel Systems.
3. Explain the components of an operating system.
4. Explain three requirements that a solution to critical-section problem must satisfy.
5. Explain the resource allocation graph.
6. What is demand paging? Explain.
7. Define file and explain file attributes.
8. Discuss dedicated devices and shared devices.
9. Differentiate between Pre-emptive and Non-preemptive Scheduling.
10. What do you mean by PCB? Where is it used? What are its contents?
11. Explain paging scheme of memory management. What hardware support is needed for its implementation?
12. What is contiguous memory allocation? Explain the hardware support for memory protection.
13. Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), analyze first-fit, best-fit, and worst-fit algorithms to place processes of specific sizes. Identify the algorithm that makes the most efficient use of memory.
14. What is a process? Draw and explain process state diagram.
15. Explain four necessary conditions for deadlock.
16. Using the Banker's algorithm, determine the content of the Matrix Need and check if the system is in a safe state given a snapshot of system allocations and maximum resources.
17. Discuss the properties of different CPU scheduling algorithms.
18. Calculate turnaround time and waiting time for pre-emptive and non-preemptive scheduling using shortest job first algorithm for a given set of processes with burst time and arrival time.
19. Discuss the access methods and file structure.
20. Explain Optimal and LRU page replacement algorithms with examples.