
UNIT-IV : DISK SCHEDULING AND FILE MANAGEMENT
Part-A (2 Marks)
Define seek time and latency time.
What is File Organization and File Volatility?
Mention the major attributes of a file.
State what is required to support dynamic allocation in contiguous memory allocation
What do you mean by page fault?
Differentiate internal and external fragmentation.
Why should we use virtual memory?
What is memory compaction?
Define seek time and latency time.
Describe the Deadlock methods & Methods for Handling the deadlock.
Comparison between detection, Prevention and Avoidance methods of handling
deadlock. .
Explain the techniques for deadlock detection.
Discuss the about of Management Strategies
Explain Banker’s algorithm for deadlock avoidance in detail with an example
Consider the following page reference string
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,4,5,3.How many page faults would occur for the
following replacement algorithms? Assume four frames are initially empty. i)LRU
replacement ii)FIFO replacement iii)Optimal replacement
Explain swapping and contiguous memory allocation
Explain briefly about File System Implementation & File System Interface
Summarize the technical details of Mass Storage Structure & Windows, Linux and
Android operating Systems.
Compare the functionalities of FCFS,SSTF,CSAN and C-LOOK disk scheduling
algorithms with a examples for each.. with neat diagram.
Discuss the different file allocation methods with suitable example.
Explain the function of caching only serves
Explain the design principles of Linux system