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

Which of the following is true?

A. Overlays are used to increase the size of physical memory
B. Overlays are used to increase the logical address space
C. When overlays are used, the size of a process is not limited to the size of the physical memory
D. Overlays are used whenever the physical address space is smaller than the logical address space

What is Address Binding?

A. Going to an address in memory
B. Locating an address with the help of another address
C. Binding two addresses together to form a new address in a different memory space
D. A mapping from one address space to another

Binding of instructions and data to memory addresses can be done at ____________

A. Compile time
B. Load time
C. Execution time
D. All of the mentioned

If the process can be moved during its execution from one memory segment to another, then binding must be ____________

A. Delayed until run time
B. Preponed to compile time
C. Preponed to load time
D. None of the mentioned

What is Dynamic loading?

A. Loading multiple routines dynamically
B. Loading a routine only when it is called
C. Loading multiple routines randomly
D. None of the mentioned

What is the advantage of dynamic loading?

A. A used routine is used multiple times
B. An unused routine is never loaded
C. Cpu utilization increases
D. All of the mentioned

The idea of overlays is to ____________

A. Data that are needed at any given time
B. Enable a process to be larger than the amount of memory allocated to it
C. Keep in memory only those instructions
D. All of the mentioned

The ___________ must design and program the overlay structure.

A. Programmer
B. System architect
C. System designer
D. None of the mentioned

The ___________ swaps processes in and out of the memory.

A. Memory manager
B. Cpu
C. Cpu manager
D. User

If a higher priority process arrives and wants service, the memory manager can swap out the lower priority process to execute the higher priority process. When the higher priority process finishes, the lower priority process is swapped back in and continues execution. This variant of swapping is sometimes called?

A. Priority swapping
B. Pull out, push in
C. Roll out, roll in
D. None of the mentioned