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

Because of virtual memory, the memory can be shared among ____________

A. Processes
B. Threads
C. Instructions
D. None of the mentioned

_____ is the concept in which a process is copied into the main memory from the secondary memory according to the requirement.

A. Paging
B. Demand paging
C. Segmentation
D. Swapping

The pager concerns with the ____________

A. Individual page of a process
B. Entire process
C. Entire thread
D. First page of a process

Swap space exists in ____________

A. Primary memory
B. Secondary memory
C. Cpu
D. None of the mentioned

Effective access time is directly proportional to ____________

A. Page-fault rate
B. Hit ratio
C. Memory access time
D. None of the mentioned

In FIFO page replacement algorithm, when a page must be replaced ____________

A. Oldest page is chosen
B. Newest page is chosen
C. Random page is chosen
D. None of the mentioned

Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced?

A. First in first out algorithm
B. Additional reference bit algorithm
C. Least recently used algorithm
D. Counting based page replacement algorithm

Working set model for page replacement is based on the assumption of ____________

A. Modularity
B. Locality
C. Globalization
D. Random access