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

The minimum number of frames to be allocated to a process is decided by the ____________

A. The amount of available physical memory
B. Operating system
C. Instruction set architecture
D. None of the mentioned

When a page fault occurs before an executing instruction is complete if ____________

A. The instruction must be restarted
B. The instruction must be ignored
C. The instruction must be completed ignoring the page fault
D. None of the mentioned

Consider a machine in which all memory reference instructions have only one memory address, for them we need at least _____ frame(s).

A. One
B. Two
C. Three
D. None of the mentioned

Explanation: At least one frame for the instruction and one for the memory reference.

The maximum number of frames per process is defined by ____________

A. The amount of available physical memory
B. Operating system
C. Instruction set architecture
D. None of the mentioned

The algorithm in which we split m frames among n processes, to give everyone an equal share, m/n frames is known as ____________

A. Proportional allocation algorithm
B. Equal allocation algorithm
C. Split allocation algorithm
D. None of the mentioned

The algorithm in which we allocate memory to each process according to its size is known as ____________

A. Proportional allocation algorithm
B. Equal allocation algorithm
C. Split allocation algorithm
D. None of the mentioned

With either equal or proportional algorithm, a high priority process is treated ___________ a low priority process.

A. Greater than
B. Same as
C. Lesser than
D. None of the mentioned

_________ replacement allows a process to select a replacement frame from the set of all frames, even if the frame is currently allocated to some other process.

A. Local
B. Universal
C. Global
D. Public

_________ replacement allows each process to only select from its own set of allocated frames.

A. Local
B. Universal
C. Global
D. Public

One problem with the global replacement algorithm is that ____________

A. It is very expensive
B. Many frames can be allocated to a process
C. Only a few frames can be allocated to a process
D. A process cannot control its own page €? fault rate