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

In internal fragmentation, memory is internal to a partition and ____________

A. Is being used
B. Is not being used
C. Is always used
D. None of the mentioned

A solution to the problem of external fragmentation is ____________

A. Compaction
B. Larger memory space
C. Smaller memory space
D. None of the mentioned

Another solution to the problem of external fragmentation problem is to ____________

A. Permit the logical address space of a process to be noncontiguous
B. Permit smaller processes to be allocated memory at last
C. Permit larger processes to be allocated memory at last
D. All of the mentioned

If relocation is static and is done at assembly or load time, compaction _________

A. Cannot be done
B. Must be done
C. Must not be done
D. Can be done

The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is ____________

A. The cost incurred
B. The memory used
C. The cpu used
D. All of the mentioned

__________ is generally faster than _________ and _________

A. First fit, best fit, worst fit
B. Best fit, first fit, worst fit
C. Worst fit, best fit, first fit
D. None of the mentioned

External fragmentation exists when?

A. Enough total memory exists to satisfy a request but it is not contiguous
B. The total memory is insufficient to satisfy a request
C. A request cannot be satisfied even when the total memory is free
D. None of the mentioned

External fragmentation will not occur when?

A. First fit is used
B. Best fit is used
C. Worst fit is used
D. No matter which algorithm is used, it will always occur

Sometimes the overhead of keeping track of a hole might be ____________

A. Larger than the memory
B. Larger than the hole itself
C. Very small
D. All of the mentioned

When the memory allocated to a process is slightly larger than the process, then ____________

A. Internal fragmentation occurs
B. External fragmentation occurs
C. Both internal and external fragmentation occurs
D. Neither internal nor external fragmentation occurs