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

Swapping _______ be done when a process has pending I/O, or has to execute I/O operations only into operating system buffers.

A. Must
B. Can
C. Must never
D. Maybe

The address generated by the CPU is referred to as ____________

A. Physical address
B. Logical address
C. Neither physical nor logical
D. None of the mentioned

The address loaded into the memory address register of the memory is referred to as ____________

A. Physical address
B. Logical address
C. Neither physical nor logical
D. None of the mentioned

The run time mapping from virtual to physical addresses is done by a hardware device called the ____________

A. Virtual to physical mapper
B. Memory management unit
C. Memory mapping unit
D. None of the mentioned

The base register is also known as the ____________

A. Basic register
B. Regular register
C. Relocation register
D. Delocation register

The size of a process is limited to the size of ____________

A. Physical memory
B. External storage
C. Secondary storage
D. None of the mentioned

If execution time binding is being used, then a process ______ be swapped to a different memory space.

A. Has to be
B. Can never
C. Must
D. May

Swapping requires a _________

A. Motherboard
B. Keyboard
C. Monitor
D. Backing store

The backing store is generally a ____________

A. Fast disk
B. Disk large enough to accommodate copies of all memory images for all users
C. Disk to provide direct access to the memory images
D. All of the mentioned

The ________ consists of all processes whose memory images are in the backing store or in memory and are ready to run.

A. Wait queue
B. Ready queue
C. Cpu
D. Secondary storage