File System – Allocation Methods – 2 MCQ’s

Electronics & Communication Engineering Operating System

This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “File System – Allocation Methods – 2″.

1. The file organization module knows about _____________
a) files
b) logical blocks of files
c) physical blocks of files
d) all of the mentioned

2. Metadata includes _____________
a) all of the file system structure
b) contents of files
c) both file system structure and contents of files
d) none of the mentioned

3. A device driver can be thought of like a translator. Its input consists of _____ commands and output consists of _______ instructions.
a) high level, low level
b) low level, high level
c) complex, simple
d) low level, complex

4. For each file there exists a ___________ that contains information about the file, including ownership, permissions and location of the file contents.
a) metadata
b) file control block
c) process control block
d) all of the mentioned

5. During compaction time, other normal system operations _______ be permitted.
a) can
b) cannot
c) is
d) none of the mentioned

6. In the linked allocation, the directory contains a pointer to which block?
I. first block
II. last block
a) I only
b) II only
c) Both I and II
d) Neither I nor II

7. For processes to request access to file contents, they need _____________
a) to run a seperate program
b) special interrupts
c) to implement the open and close system calls
d) none of the mentioned

8. When in contiguous allocation the space cannot be extended easily?
a) the contents of the file have to be copied to a new space, a larger hole
b) the file gets destroyed
c) the file will get formatted and lost all its data
d) none of the mentioned

9. There is no __________ with linked allocation.
a) internal fragmentation
b) external fragmentation
c) starvation
d) all of the mentioned

10. What if a pointer is lost or damaged in a linked allocation?
a) the entire file could get damaged
b) only a part of the file would be affected
c) there would not be any problems
d) none of the mentioned

11. By using FAT, random access time is __________
a) the same
b) increased
c) decreased
d) not affected

12. What is the major disadvantage with a linked allocation?
a) internal fragmentation
b) external fragmentation
c) there is no sequential access
d) there is only sequential access

13. FAT stands for _____________
a) File Attribute Transport
b) File Allocation Table
c) Fork At Time
d) None of the mentioned

Leave a Reply

Your email address will not be published. Required fields are marked *