OS File Systems and Their Implementation
Consider a disk where blocks 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 17, 18, 25, 26 and 27 are free and the rest of the blocks are allocated. Then the free space bitmap would be _____________
10000110000001110011111100011111โฆ
110000110000001110011111100011111โฆ
01111001111110001100000011100000โฆ
001111001111110001100000011100000โฆ
001111001111110001100000011100000โฆ
Related posts
System wide table in UNIX contains process independent information such as ____________A. location of file on disk
B. access dates
C. file size
D. all of the mentioned
Data cannot be written to secondary storage unless written within a ______
A. file
B. swap space
C. directory
D. text format
The first fit and best fit algorithms suffer from _____________
A. internal fragmentation
B. external fragmentation
C. starvation
D. all of the mentioned
_______ and ________ are the most common strategies used to select a free hole from the set of available holes.
A. First fit, Best fit
B. Worst fit, First fit
C. Best fit, Worst fit
D. None of the mentioned
What is the mount point?
A. an empty directory at which the mounted file system will be attached
B. a location where every time file systems are mounted
C. is the time when the mounting is done
D. none of the mentioned
On systems where there are multiple operating system, the decision to load a particular one is done by _____________
A. boot loader
B. bootstrap
C. process control block
D. file control block
Disks are segmented into one or more partitions, each containing a file system or ______
A. left โrawโ
B. made into swap space
C. made into backup space
D. left โripeโ
Leave a Reply