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

What is a reusable resource?

A. That can be used by one process at a time and is not depleted by that use
B. That can be used by more than one process at a time
C. That can be shared between various threads
D. None of the mentioned

Which of the following condition is required for a deadlock to be possible?

A. Mutual exclusion
B. A process may hold allocated resources while awaiting assignment of other resources
C. No resource can be forcibly removed from a process holding it
D. All of the mentioned

A system is in the safe state if ____________

A. The system can allocate resources to each process in some order and still avoid a deadlock
B. There exist a safe sequence
C. All of the mentioned
D. None of the mentioned

Explanation: Safe State $neq$ Deadlock-free: A safe state is deadlock-free, but an unsafe state is not necessarily a deadlock; it just means the system could potentially fall into a deadlock if it isn't careful while the Banker's Algorithm: This is the most common algorithm used by operating systems to determine if granting a resource request will leave the system in a safe state.

The circular wait condition can be prevented by ____________

A. Defining a linear ordering of resource types
B. Using thread
C. Using pipes
D. All of the mentioned

Which one of the following is the deadlock avoidance algorithm?

A. Banker’s algorithm
B. Round-robin algorithm
C. Elevator algorithm
D. Karn’s algorithm

What is the drawback of banker’s algorithm?

A. In advance processes rarely know how much resource they will need
B. The number of processes changes as time progresses
C. Resource once available can disappear
D. All of the mentioned

A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________

A. Deadlock
B. Starvation
C. Inversion
D. Aging

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

A. Resource allocation graph
B. Starvation graph
C. Inversion graph
D. None of the mentioned

To avoid deadlock ____________

A. There must be a fixed number of resources to allocate
B. Resource allocation must be done only once
C. All deadlocked processes must be aborted
D. Inversion technique can be used