Operating System » File System Allocation Methods 1
Operating System Subcategories
Application Io Interface 1Application Io Interface 2
Atomic TransactionsBasics
Classic Sync ProblemsCommunication Systems Bandwidth Transmission Medium
Cpu SchedulingCpu Scheduling 2
Cpu Scheduling Algorithms 1Cpu Scheduling Algorithms 2
Cpu Scheduling BenefitsCritical Section Problem
DeadlockDeadlock Avoidance
Deadlock DetectionDeadlock Prevention
Deadlock RecoveryDisk Management
Disk Scheduling 1Disk Scheduling 2
Distributed File SystemDistributed Operating System
Distributed SynchronizationFile System 1
File System Allocation Methods 1File System Allocation Methods 2
File System Allocation Methods 3File System Concepts
File System Free Space PerformanceFile System Implementation
File System Interface Access Methods 1File System Interface Access Methods 2
File System Interface Directory Structure 1File System Interface Directory Structure 2
File System Interface Mounting SharingFile System Interface Protection
File System RecoveryInter Process Communication
Io SubsystemKernel Io Subsystems
LinuxMass Storage Raid 1
Mass Storage Raid 2Mass Storage Tertiary Storage
Memory Allocation 1Memory Allocation 2
Memory ManagementMemory Management Paging 1
Memory Management Paging 2Memory Management Segmentation
Memory Management Swapping 1Memory Management Swapping 2
Multi Threading ModelsMultimedia System Compression 1
Multimedia System Compression 2Multimedia System Compression 3
Multimedia System Cpu Disk SchedulingMultimedia System Network Management
Network File System 1Network File System 2
Network Structure TopologyOperating System
Process Control BlockProcess Creation
Process RpcProcess Scheduling Queue
Process StructuresProcess Sync Monitors
Process SynchronizationProcesses
Protection Access MatrixProtection Concepts
Protection Memory ProtectionProtection Revocation Access Rights
RobustnessRtos
Secondary StorageSecurity
Security CryptographySecurity Intrusion Detection
Security Program System ThreatsSecurity System Facility
Security User AuthenticationSemaphores 1
Semaphores 2Swap Space Management
ThreadsThreads Cancellation
Threads Fork ExecThreads Pools
Threads Signal HandlingThreads Ult Klt
Two Port NetworkVirtual Memory
Virtual Memory Demand PagingVirtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing
In contiguous allocation _____________
A. Each file must occupy a set of contiguous blocks on the disk
B. Each file is a linked list of disk blocks
C. All the pointers to scattered blocks are placed together in one location
D. None of the mentioned
Read more about this MCQ
In linked allocation _____________
A. Each file must occupy a set of contiguous blocks on the disk
B. Each file is a linked list of disk blocks
C. All the pointers to scattered blocks are placed together in one location
D. None of the mentioned
Read more about this MCQ
In indexed allocation _____________
A. Each file must occupy a set of contiguous blocks on the disk
B. Each file is a linked list of disk blocks
C. All the pointers to scattered blocks are placed together in one location
D. None of the mentioned
Read more about this MCQ
What is the real disadvantage of a linear list of directory entries?
A. Size of the linear list in memory
B. Linear search to find a file
C. It is not reliable
D. All of the mentioned
Read more about this MCQ
Contiguous allocation of a file is defined by _____________
A. Disk address of the first block & length
B. Length & size of the block
C. Size of the block
D. Total size of the file
Read more about this MCQ
One difficulty of contiguous allocation is _____________
A. Finding space for a new file
B. Inefficient
C. Costly
D. Time taking
Read more about this MCQ
_______ and ________ are the most common strategies used to select a free hole from the set of available holes.
A. First fit, best fit
B. Worst fit, first fit
C. Best fit, worst fit
D. None of the mentioned
Read more about this MCQ