Module - 4
1 What is Directory? 2
2 What are the operations that can be performed on a Directory? 2
3 What is Access Control List (ACL)? 2
4 What is Absolute Path Names? 2
5 What is Relative Path Names? 2
6 Why must the bit map for file allocation be kept on mass
2
storage rather than in main memory?
7 Describe the concept of acyclic graph directories 2
8 What is the information associated with an Open File? 2
9 What is volume control block 2
10 Define the concept of low-level formatting 2
11 Define master boot record 2
12 Define Master File Directory? 2
13 What is Sector Sparing? 2
14 Define unified virtual memory 2
15 How free-space is managed using bit vector implementation? 2
16 Mention the objectives of File Management System. 2
17 What is the content of a typical file control block? 2
18 What are the functions of virtual file system (VFS)? 2
19 Define seek time and latency time? 2
20 Define Rotational Latency and Disk Bandwidth. 2
21 Determine the most common schemes for defining the logical
5
structure of a directory?
22 What are the various file operations? Briefly describe each type. 5
23 Illustrate the different Accessing Methods of a File? 5
24 Compare the advantages and disadvantages of Contiguous
5
Allocation and Linked Allocation?
What are the advantages of Indexed Allocation? How can the
25 index blocks be implemented in the Indexed Allocation 5
Scheme?
26 Illustrate an application that could benefit from operating
5
system support for random access to indexed files.
27 What are the Structures used in File-System Implementation? 5
28 Explain in detail the disk structure and implementation 5
29 Write short notes on disk management 5
30 What are points to be consider in file system design? Explain
10
linked list allocation & index allocation in detail.
31 Explain file system implementation using linked list with index
10
and i-node in detail?
32 Explain and compare FCFS, SSTF, C-SCAN and C-LOOK disk
10
scheduling algorithms with examples
Consider the disk queue 98,183, 37, 122, 14, 124, 65, 67 and
33 apply the FCFS and SSTF Algorithm to find the total head
10
movement of the cylinders, where the head is initially at
cylinder 53. The cylinders are numbered ranging from 0 to 199.
34 Explain the issues in designing a file system. Explain the
10
various file directory structures.
Consider a disk queue with requests for I/O to blocks on
cylinders 47, 38, 121, 191, 87,11,92,10. The SCAN and C-
35 SCAN scheduling algorithm is used. The head is initially at
10
cylinder 63. The cylinders are numbered ranging from 0 to 199.
What is the total number of head movements are required while
servicing these requests.
Consider a disk queue with requests for I/O to blocks on
cylinders 24, 45, 163, 189, 77,17,81,90. The C-LOOK and C-
36 SCAN scheduling algorithm is used. The head is initially at
10
cylinder 72. The cylinders are numbered ranging from 0 to 199.
What is the total number of head movements are required while
servicing these requests.
1. A network file server implements different disk scheduling algorithms (FCFS, SSTF, SCAN, and C-LOOK)
for optimizing disk access times. Given an initial head position and a sequence of disk requests,
analyze which algorithm minimizes seek time the most. Provide a comparative performance analysis
based on worst-case and average-case scenarios. 10
2. A disk scheduling system receives the following request queue (in cylinder numbers):
98, 183, 37, 122, 14, 124, 65, 67
If the initial head position is 53, calculate the total head movement using FCFS, SSTF, and
SCAN algorithms. 10
File System, Secondary storage structure
5
5
10
10
10
10
10
10