OS Unit 5 – I/O Management and Disk Scheduling Previous Year Questions

On this page, you will find all the most important and most asked questions from unit 5 of the Operating System subject. 

Questions

1. Write a short note on Memory Mapped I/O and Direct Access Method for file.
   
2. Write the difference between Block and Character Devices.
   
3. Write a note on Blocking and non-Blocking I/O.
   
4. Explain Direct Memory Access I/O Technique with diagrams.
   
5. Explain I/O Buffering. Also Explain its types.
   
6. Write the difference between Single Buffering and Double buffering.
   
7. Write a short note on Disk Scheduling Algorithms.
   
8. Write the different criteria for the selection of disk scheduling algorithm.
   
9. Write a short note on RAID (Redundant Array of Independent Disk).
   
10. What is file system. Write the functions of file systems.
    
11. Discuss the following with respect to file System : Common file attributes and file operation.
    
12. Write a note on different types of file system. Also discuss the access mechanism.
    
13. Explain Sequential File and Indexed File System.
    
14. What is directory in file System? Explain the various ways to implement the directory.
    
15. Explain the various file allocation methods for disk space management. Also write its advantages and disadvantages.
    
16. Explain the implementation of access matrix.
    
17. Write the difference between Linked List and bit map approach for free space memory management.
    
18. Explain the File System Protection.
19. Discuss the FCFS(First Come First Serve) scheduling algorithm. Write its advantage and disadvantage.
20. Discuss the SJF(Shortest Job First) scheduling algorithm. Write its advantage and disadvantage.
21. Discuss the Priority scheduling algorithm. Write its advantage and disadvantage.
22. Discuss the Round Robin scheduling algorithm. Write its advantage and disadvantage.
23. Discuss the multilevel queue scheduling algorithm. Write its advantage and disadvantage.
24. Discuss the multilevel feedback queue scheduling algorithm. Write its advantage and disadvantage.
25. What is deadlock? Explain with the help of example.
26. Write the necessary condition for deadlock.
27. What do you understand by resource allocation graph. Explain with suitable diagram.
28. How you can prevent the deadlock.
29. What do you understand by deadlock avoidance?
30. Explain the banker’s algorithm for avoiding deadlock.
31. What do you understand by starvation?
32. Write the difference between deadlock and starvation.