File System2

Q 1 An advantage of the file allocation table file structure over the linked file structure is
a. The file allocation table solution uses much less disk space than the linked
structure.
b. The linked structure uses much less disk space than the file allocation table
structure.
c. The file allocation table method allows faster seeks in files.
d. The linked allocation method allows faster seeks in files.

Q2 A Unix inode stores

a. Only the name of a file.
b. Only file allocation information about a file.
c. Only access permission information about a file.
d. Access permissions and file allocation information for a file, as well as some
other information.

Q3 Clustering is
a. Creating large logical disk blocks from collections of contiguous physical disk
blocks.
b. Allocating directories close to one another.
c. Allocating files close to one another.
d. Moving the blocks of a file closer to one another on the disk.

Q4 An advantage of clustering for a file allocation table is

a. The file allocation table can be made contiguous on the disk.
b. The file allocation table is smaller.
c. The file allocation table can probably fit in a single disk block.
d. The file allocation table becomes entirely unnecessary.

Q5 Memory compaction is a solution to

a) the dynamic linking problem.
b) the static linking problem.
c) the internal fragmentation problem.
d) the external fragmentation problem.

Q6 Which is false:
a. The memory usage of bitmapped free memory management depends on the amount of
memory in the system
b. Linked list free memory management requires extra hardware
c. Linked list free memory management incurs more overhead when memory is freed

Q7 Which one of the following allocation schemes is the best choice if fast random read
access of a large file is the only concern?
1A. Contiguous allocation.
2B. Linked allocation.
3C. Indexed allocation.
 4D. Multi-level indexed allocation.

Q8 Which two schemes are commonly used to manage disk free-space?

1A. Hash and linked list.
2B. Hash and bit-vector.
3C. FIFO and bit-vector.
4D. FIFO and linked list.
5E. Bit vector and linked list.

Q9 Which one of the following is NOT stored in a disk partition?

1A. Master boot record.
2B. Super block.
3C. Free-space management information.
4D. inode data.
5E. Directory names.

Q10 Which one of following best describes the seek time of a disk?
1A. Latency of moving the disk head
2B. Time required to access one block from the disk
3C. Latency of moving the disk head plus the average rotational delay
4D. Latency of moving the disk head plus the maximal rotational delay

Q11 A 512KB file is stored contiguously on one disk track. Each track contains 1024
sectors, each sector is 512 bytes. Average seek time=1ms and rotational speed is 15,000
RPM (Rotations Per Minute) . What is the average access time to read the entire file, in
milliseconds? Hint: 60,000 RPM = 1 rotation per 1ms.
1A. Between 0 and 1.9 ms
2B. Between 2.0 and 2.4 ms
3C. Between 2.5 and 2.9 ms
4D. Between 3.0 and 4.9 ms
5E. Between 5.0 and 10.0 ms

Answer 1 c 2 d 3 a 4 b 5 d 6 b 7 a 8 e 9 a 10 a