Question 46
SCAN disk scheduling algorithm is also known as the -
SCAN moves the disk head back and forth across the disk surface servicing requests, behaving like a building elevator.
SCAN disk scheduling algorithm is also known as the -
SCAN moves the disk head back and forth across the disk surface servicing requests, behaving like a building elevator.
How does C-SCAN (Circular SCAN) differ from regular SCAN disk scheduling?
C-SCAN sweeps in one direction servicing requests, then immediately jumps back to the starting end without servicing requests on the return sweep.
In Unix file system, an Inode (Index node) stores -
An Inode is a data structure storing file metadata (owner, permissions, size, modification time) and pointers to data blocks, but not file name/data.
A file allocation method where each file occupies a contiguous set of blocks on disk suffers from -
Contiguous file allocation suffers from external disk fragmentation as files are created and deleted, leaving scattered free holes.
Indexed file allocation solves external fragmentation and direct access problems by using a dedicated -
Indexed allocation brings all pointers for a file together into an Index Block, allowing direct access without external fragmentation.