Operating System Subcategories

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

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

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

The FAT is used much as a _________

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

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

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

Each _______ has its own index block.

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

Indexed allocation _________ direct access.

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

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

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

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.

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€?