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

The file organization module knows about _____________

A. Files
B. Logical blocks of files
C. Physical blocks of files
D. All of the mentioned

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

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

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

During compaction time, other normal system operations _______ be permitted.

A. Can
B. Cannot
C. Is
D. None of the mentioned

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

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

There is no __________ with linked allocation.

A. Internal fragmentation
B. External fragmentation
C. Starvation
D. All of the mentioned

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