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 wait-for graph is a deadlock detection algorithm that is applicable when ____________

A. All resources have a single instance
B. All resources have multiple instances
C. All resources have a single 7 multiple instances
D. All of the mentioned

An edge from process Pi to Pj in a wait for graph indicates that ____________

A. Pi is waiting for pj to release a resource that pi needs
B. Pj is waiting for pi to release a resource that pj needs
C. Pi is waiting for pj to leave the system
D. Pj is waiting for pi to leave the system

If the wait for graph contains a cycle ____________

A. Then a deadlock does not exist
B. Then a deadlock exists
C. Then the system is in a safe state
D. Either deadlock exists or system is in a safe state

If deadlocks occur frequently, the detection algorithm must be invoked ________

A. Rarely
B. Frequently
C. Rarely & frequently
D. None of the mentioned

What is the disadvantage of invoking the detection algorithm for every request?

A. Overhead of the detection algorithm due to consumption of memory
B. Excessive time consumed in the request to be allocated memory
C. Considerable overhead in computation time
D. All of the mentioned

A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

A. Increase
B. Drop
C. Stay still
D. None of the mentioned

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________

A. The set of processes that have been deadlocked
B. The set of processes in the deadlock queue
C. The specific process that caused the deadlock
D. All of the mentioned

A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?

A. 2
B. 3
C. 4
D. 1

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________

A. Can never occur
B. May occur
C. Has to occur
D. None of the mentioned

‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock ____________

A. Can never occur
B. May occur
C. Has to occur
D. None of the mentioned