Q#1: File-system implementation deals with:
(A) Managing how files are stored and accessed on disk
(B) CPU scheduling
(C) Cache replacement
(D) Memory allocation
Answer: (A) Managing how files are stored and accessed on disk
Q#2: The main components of file-system implementation are:
(A) Disk management, allocation methods, directory implementation
(B) CPU registers
(C) Cache lines
(D) Memory blocks
Answer: (A) Disk management, allocation methods, directory implementation
Q#3: Disk blocks are:
(A) Fixed-size units of storage on disk
(B) CPU registers
(C) Cache lines
(D) Memory blocks
Answer: (A) Fixed-size units of storage on disk
Q#4: Contiguous allocation stores:
(A) File in consecutive disk blocks
(B) Linked list of blocks
(C) Indexed blocks only
(D) CPU registers
Answer: (A) File in consecutive disk blocks
Q#5: Advantage of contiguous allocation:
(A) Simple and fast access
(B) Supports dynamic growth easily
(C) Reduces CPU registers
(D) Improves cache
Answer: (A) Simple and fast access
Q#6: Disadvantage of contiguous allocation:
(A) External fragmentation
(B) Internal fragmentation only
(C) CPU idle
(D) Cache misses
Answer: (A) External fragmentation
Q#7: Linked allocation stores:
(A) Each file block contains pointer to next block
(B) Consecutive blocks
(C) Indexed allocation
(D) CPU registers
Answer: (A) Each file block contains pointer to next block
Q#8: Advantage of linked allocation:
(A) No external fragmentation
(B) Fast random access
(C) CPU optimization
(D) Cache improvement
Answer: (A) No external fragmentation
Q#9: Disadvantage of linked allocation:
(A) Sequential access only; inefficient direct access
(B) External fragmentation
(C) CPU idle
(D) Cache only
Answer: (A) Sequential access only; inefficient direct access
Q#10: Indexed allocation stores:
(A) Pointers to all file blocks in an index block
(B) Linked list only
(C) Contiguous blocks
(D) CPU registers
Answer: (A) Pointers to all file blocks in an index block
Q#11: Indexed allocation advantage:
(A) Supports direct access efficiently
(B) Sequential access only
(C) CPU optimization
(D) Cache improvement
Answer: (A) Supports direct access efficiently
Q#12: Indexed allocation disadvantage:
(A) Extra space for index block
(B) External fragmentation
(C) CPU idle
(D) Cache only
Answer: (A) Extra space for index block
Q#13: File control block (FCB) stores:
(A) Metadata like file size, pointers, attributes
(B) CPU registers
(C) Cache line
(D) Memory block
Answer: (A) Metadata like file size, pointers, attributes
Q#14: Metadata includes:
(A) Permissions, timestamps, disk locations
(B) CPU registers
(C) Cache lines
(D) Memory blocks
Answer: (A) Permissions, timestamps, disk locations
Q#15: Directory implementation involves:
(A) Data structures to store file names and pointers
(B) CPU scheduling
(C) Cache management
(D) Memory allocation
Answer: (A) Data structures to store file names and pointers
Q#16: Single-level directory implementation:
(A) Array of file names and pointers
(B) Tree structure
(C) Linked list
(D) Cache only
Answer: (A) Array of file names and pointers
Q#17: Two-level directory implementation:
(A) Each user has a separate directory
(B) Single global directory
(C) Tree structure
(D) Cache only
Answer: (A) Each user has a separate directory
Q#18: Tree-structured directory implementation:
(A) Uses parent-child relationships for directories
(B) Single-level only
(C) Two-level only
(D) CPU registers
Answer: (A) Uses parent-child relationships for directories
Q#19: Accessing a file requires:
(A) Traversing directory structure to get disk block locations
(B) Only CPU access
(C) Only cache access
(D) Memory allocation
Answer: (A) Traversing directory structure to get disk block locations
Q#20: File allocation table (FAT) keeps:
(A) Linked list of disk blocks for each file
(B) CPU registers
(C) Memory blocks
(D) Cache lines
Answer: (A) Linked list of disk blocks for each file
Q#21: Free-space management methods include:
(A) Bit vector, linked list, grouping, counting
(B) Only CPU registers
(C) Only cache lines
(D) Memory only
Answer: (A) Bit vector, linked list, grouping, counting
Q#22: Bit vector method:
(A) Uses a bitmap to track free and allocated blocks
(B) Linked list only
(C) Grouping only
(D) CPU registers
Answer: (A) Uses a bitmap to track free and allocated blocks
Q#23: Linked list free-space method:
(A) Each free block contains pointer to next free block
(B) Bitmap only
(C) Counting only
(D) CPU register
Answer: (A) Each free block contains pointer to next free block
Q#24: Grouping method improves:
(A) Disk access time for free-space list
(B) CPU optimization
(C) Cache only
(D) Memory only
Answer: (A) Disk access time for free-space list
Q#25: Counting method reduces:
(A) Number of pointers needed in free-space list
(B) CPU cycles
(C) Cache usage
(D) Memory allocation
Answer: (A) Number of pointers needed in free-space list
Q#26: Free-space list stores:
(A) Addresses of all free disk blocks
(B) CPU registers
(C) Cache lines
(D) Memory blocks
Answer: (A) Addresses of all free disk blocks
Q#27: Disk caching stores:
(A) Frequently accessed disk blocks in main memory
(B) CPU registers only
(C) Memory only
(D) Cache only
Answer: (A) Frequently accessed disk blocks in main memory
Q#28: Disk buffering improves:
(A) Data transfer efficiency between CPU and disk
(B) CPU scheduling
(C) Memory allocation
(D) Cache replacement
Answer: (A) Data transfer efficiency between CPU and disk
Q#29: File system consistency is maintained by:
(A) Journaling or write-ahead logs
(B) CPU registers only
(C) Memory only
(D) Cache only
Answer: (A) Journaling or write-ahead logs
Q#30: Log-structured file system stores:
(A) All modifications in a sequential log
(B) Contiguous blocks
(C) Linked blocks only
(D) CPU registers
Answer: (A) All modifications in a sequential log
Q#31: Virtual file system (VFS) provides:
(A) Uniform interface to different file system types
(B) Only CPU access
(C) Cache management
(D) Memory allocation
Answer: (A) Uniform interface to different file system types
Q#32: In VFS, file operations are handled via:
(A) Generic file system interface
(B) CPU registers only
(C) Memory blocks
(D) Cache lines
Answer: (A) Generic file system interface
Q#33: Inode stores:
(A) File metadata and disk block pointers
(B) CPU registers
(C) Cache line
(D) Memory block
Answer: (A) File metadata and disk block pointers
Q#34: Extent-based allocation stores:
(A) Contiguous groups of blocks called extents
(B) Single blocks only
(C) Linked blocks
(D) Indexed blocks
Answer: (A) Contiguous groups of blocks called extents
Q#35: Extents reduce:
(A) Fragmentation and metadata overhead
(B) CPU usage
(C) Cache usage
(D) Memory allocation
Answer: (A) Fragmentation and metadata overhead
Q#36: Disk scheduling in file system implementation:
(A) Improves disk access performance
(B) CPU registers only
(C) Memory only
(D) Cache only
Answer: (A) Improves disk access performance
Q#37: Disk striping divides file data across:
(A) Multiple disks for performance
(B) Single disk only
(C) CPU registers
(D) Cache lines
Answer: (A) Multiple disks for performance
Q#38: Disk mirroring duplicates:
(A) Data on two disks for fault tolerance
(B) Only CPU registers
(C) Memory only
(D) Cache only
Answer: (A) Data on two disks for fault tolerance
Q#39: File system mounting involves:
(A) Making file system accessible at a directory
(B) CPU scheduling
(C) Memory allocation
(D) Cache management
Answer: (A) Making file system accessible at a directory
Q#40: File system unmounting ensures:
(A) All pending writes are flushed to disk
(B) CPU idle
(C) Cache cleared
(D) Memory allocated
Answer: (A) All pending writes are flushed to disk
Q#41: Journaling file systems improve:
(A) Crash recovery
(B) CPU scheduling
(C) Memory allocation
(D) Cache replacement
Answer: (A) Crash recovery
Q#42: Soft updates maintain:
(A) File system consistency without full journaling
(B) CPU registers only
(C) Memory only
(D) Cache only
Answer: (A) File system consistency without full journaling
Q#43: File system fragmentation affects:
(A) Disk access time
(B) CPU speed only
(C) Cache only
(D) Memory only
Answer: (A) Disk access time
Q#44: File system repair tools fix:
(A) Metadata inconsistencies and bad blocks
(B) CPU registers only
(C) Memory only
(D) Cache only
Answer: (A) Metadata inconsistencies and bad blocks
Q#45: Free block management ensures:
(A) Efficient allocation and reclamation of disk space
(B) CPU idle
(C) Memory allocation only
(D) Cache only
Answer: (A) Efficient allocation and reclamation of disk space
Q#46: File deletion requires:
(A) Releasing allocated blocks and removing directory entry
(B) CPU idle
(C) Memory allocation only
(D) Cache replacement
Answer: (A) Releasing allocated blocks and removing directory entry
Q#47: Block size choice affects:
(A) Internal fragmentation and I/O efficiency
(B) CPU only
(C) Cache only
(D) Memory only
Answer: (A) Internal fragmentation and I/O efficiency
Q#48: File-system implementation abstracts:
(A) Physical storage details from user and application programs
(B) CPU registers
(C) Cache only
(D) Memory only
Answer: (A) Physical storage details from user and application programs
Q#49: File system mounting points are:
(A) Directories where file systems are attached
(B) CPU registers
(C) Cache lines
(D) Memory blocks
Answer: (A) Directories where file systems are attached
Q#50: Main goal of file-system implementation:
(A) Efficient, reliable, and consistent storage management
(B) CPU optimization only
(C) Memory allocation only
(D) Cache management only
Answer: (A) Efficient, reliable, and consistent storage management