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

If the sum of the working – set sizes increases, exceeding the total number of available frames ____________

A. Then the process crashes
B. The memory overflows
C. The system crashes
D. The operating system selects a process to suspend

A process is thrashing if ____________

A. It spends a lot of time executing, rather than paging
B. It spends a lot of time paging than executing
C. It has no memory allocated to it
D. None of the mentioned

Thrashing _______ the CPU utilization.

A. Increases
B. Keeps constant
C. Decreases
D. None of the mentioned

What is a locality?

A. A set of pages that are actively used together
B. A space in memory
C. An area near a set of processes
D. None of the mentioned

When a subroutine is called ____________

A. It defines a new locality
B. It is in the same locality from where it was called
C. It does not define a new locality
D. None of the mentioned

A program is generally composed of several different localities, which _____ overlap.

A. May
B. Must
C. Do not
D. Must not

In the working set model, for: 2 6 1 5 7 7 7 7 5 1 6 2 3 4 1 2 3 4 4 4 3 4 3 4 4 4 1 3 2 3 if DELTA = 10, then the working set at time t1 (….7 5 1) is?

A. {1, 2, 4, 5, 6}
B. {2, 1, 6, 7, 3}
C. {1, 6, 5, 7, 2}
D. {1, 2, 3, 4, 5}

The accuracy of the working set depends on the selection of ____________

A. Working set model
B. Working set size
C. Memory size
D. Number of pages in memory

If working set window is too small ____________

A. It will not encompass entire locality
B. It may overlap several localities
C. It will cause memory problems
D. None of the mentioned

If working set window is too large ____________

A. It will not encompass entire locality
B. It may overlap several localities
C. It will cause memory problems
D. None of the mentioned