Engineering Questions with Answers - Multiple Choice Questions
Operating System MCQ – File System Implementation – Allocation Methods – 3
1 - Question
A better way of contiguous allocation to extend the file size is _____________
a) adding an extent (another chunk of contiguous space)
b) adding an index table to the first contiguous block
c) adding pointers into the first contiguous block
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
2 - Question
If the extents are too large, then what is the problem that comes in?
a) internal fragmentation
b) external fragmentation
c) starvation
d) all of the mentioned
View Answer
Answer: a
Explanation: None.
3 - Question
The FAT is used much as a _________
a) stack
b) linked list
c) data
d) pointer
View Answer
Answer: b
Explanation: None.
4 - Question
A section of disk at the beginning of each partition is set aside to contain the table in _____________
a) fat
b) linked allocation
c) hashed allocation
d) indexed allocation
View Answer
Answer: a
Explanation: None.
5 - Question
View Answer
6 - Question
Contiguous allocation has two problems _________ and _________ that linked allocation solves.
a) external – fragmentation & size – declaration
b) internal – fragmentation & external – fragmentation
c) size – declaration & internal – fragmentation
d) memory – allocation & size – declaration
View Answer
Answer: a
Explanation: None.
7 - Question
Each _______ has its own index block.
a) partition
b) address
c) file
d) all of the mentioned
View Answer
Answer: c
Explanation: None.
8 - Question
Indexed allocation _________ direct access.
a) supports
b) does not support
c) is not related to
d) none of the mentioned
View Answer
Answer: a
Explanation: None.
9 - Question
The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation.
a) less than
b) equal to
c) greater than
d) keeps varying with
View Answer
Answer: c
Explanation: None.
10 - Question
For any type of access, contiguous allocation requires ______ access to get a disk block.
a) only one
b) at least two
c) exactly two
d) none of the mentioned
View Answer
Answer: a
Explanation: We can easily keep the initial address of the file in memory and calculate immediately the disk address of the ith block and read it directly.
11 - Question
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 _____________
a) 10000110000001110011111100011111…
b) 110000110000001110011111100011111…
c) 01111001111110001100000011100000…
d) 001111001111110001100000011100000…
View Answer
Answer: d
Explanation: None.