File System Allocation Methods 3 MCQs

10 MCQs — Operating System MCQs

Practice File System Allocation Methods 3 MCQs with correct answers and explanations. These questions are from the Operating System MCQs section.

Attempt File System Allocation Methods 3 Quiz

Operating System Subcategories

Application Io Interface 1	Application Io Interface 2
Atomic Transactions	Basics
Classic Sync Problems	Communication Systems Bandwidth Transmission Medium
Cpu Scheduling	Cpu Scheduling 2
Cpu Scheduling Algorithms 1	Cpu Scheduling Algorithms 2
Cpu Scheduling Benefits	Critical Section Problem
Deadlock	Deadlock Avoidance
Deadlock Detection	Deadlock Prevention
Deadlock Recovery	Disk Management
Disk Scheduling 1	Disk Scheduling 2
Distributed File System	Distributed Operating System
Distributed Synchronization	File System 1
File System Allocation Methods 1	File System Allocation Methods 2
File System Allocation Methods 3	File System Concepts
File System Free Space Performance	File System Implementation
File System Interface Access Methods 1	File System Interface Access Methods 2
File System Interface Directory Structure 1	File System Interface Directory Structure 2
File System Interface Mounting Sharing	File System Interface Protection
File System Recovery	Inter Process Communication
Io Subsystem	Kernel Io Subsystems
Linux	Mass Storage Raid 1
Mass Storage Raid 2	Mass Storage Tertiary Storage
Memory Allocation 1	Memory Allocation 2
Memory Management	Memory Management Paging 1
Memory Management Paging 2	Memory Management Segmentation
Memory Management Swapping 1	Memory Management Swapping 2
Multi Threading Models	Multimedia System Compression 1
Multimedia System Compression 2	Multimedia System Compression 3
Multimedia System Cpu Disk Scheduling	Multimedia System Network Management
Network File System 1	Network File System 2
Network Structure Topology	Operating System
Process Control Block	Process Creation
Process Rpc	Process Scheduling Queue
Process Structures	Process Sync Monitors
Process Synchronization	Processes
Protection Access Matrix	Protection Concepts
Protection Memory Protection	Protection Revocation Access Rights
Robustness	Rtos
Secondary Storage	Security
Security Cryptography	Security Intrusion Detection
Security Program System Threats	Security System Facility
Security User Authentication	Semaphores 1
Semaphores 2	Swap Space Management
Threads	Threads Cancellation
Threads Fork Exec	Threads Pools
Threads Signal Handling	Threads Ult Klt
Two Port Network	Virtual Memory
Virtual Memory Demand Paging	Virtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1	Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing

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

Read more about this MCQ

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

Read more about this MCQ

The FAT is used much as a _________

A. Stack
B. Linked list
C. Data
D. Pointer

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

Each _______ has its own index block.

A. Partition
B. Address
C. File
D. All of the mentioned

Read more about this MCQ

Indexed allocation _________ direct access.

A. Supports
B. Does not support
C. Is not related to
D. None of the mentioned

Read more about this MCQ

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

Read more about this MCQ

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

Read more about this MCQ

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?

Read more about this MCQ

MCQs Menu

Past Papers