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

Virtual memory allows ____________

A. Execution of a process that may not be completely in memory
B. A program to be smaller than the physical memory
C. A program to be larger than the secondary storage
D. Execution of a process without being in physical memory

The instruction being executed, must be in ____________

A. Physical memory
B. Logical memory
C. Physical & logical memory
D. None of the mentioned

Error handler codes, to handle unusual errors are ____________

A. Almost never executed
B. Executed very often
C. Executed periodically
D. None of the mentioned

The ability to execute a program that is only partially in memory has benefits like ____________

A. The amount of physical memory cannot put a constraint on the program
B. Programs for an extremely large virtual space can be created
C. Throughput increases
D. All of the mentioned

In virtual memory. the programmer __________ of overlays.

A. Has to take care
B. Does not have to take care
C. All of the mentioned
D. None of the mentioned

Virtual memory is normally implemented by ________

A. Demand paging
B. Buses
C. Virtualization
D. All of the mentioned

Segment replacement algorithms are more complex than page replacement algorithms because ____________

A. Segments are better than pages
B. Pages are better than segments
C. Segments have variable sizes
D. Segments have fixed sizes

A swapper manipulates ___________ whereas the pager is concerned with individual _______ of a process.

A. The entire process, parts
B. All the pages of a process, segments
C. The entire process, pages
D. None of the mentioned

Using a pager ____________

A. Increases the swap time
B. Decreases the swap time
C. Decreases the swap time & amount of physical memory needed
D. Increases the amount of physical memory needed

The valid – invalid bit, in this case, when valid indicates?

A. The page is not legal
B. The page is illegal
C. The page is in memory
D. The page is not in memory