Operating System » Deadlock Detection
Operating System Subcategories
Application Io Interface 1Application Io Interface 2
Atomic TransactionsBasics
Classic Sync ProblemsCommunication Systems Bandwidth Transmission Medium
Cpu SchedulingCpu Scheduling 2
Cpu Scheduling Algorithms 1Cpu Scheduling Algorithms 2
Cpu Scheduling BenefitsCritical Section Problem
DeadlockDeadlock Avoidance
Deadlock DetectionDeadlock Prevention
Deadlock RecoveryDisk Management
Disk Scheduling 1Disk Scheduling 2
Distributed File SystemDistributed Operating System
Distributed SynchronizationFile System 1
File System Allocation Methods 1File System Allocation Methods 2
File System Allocation Methods 3File System Concepts
File System Free Space PerformanceFile System Implementation
File System Interface Access Methods 1File System Interface Access Methods 2
File System Interface Directory Structure 1File System Interface Directory Structure 2
File System Interface Mounting SharingFile System Interface Protection
File System RecoveryInter Process Communication
Io SubsystemKernel Io Subsystems
LinuxMass Storage Raid 1
Mass Storage Raid 2Mass Storage Tertiary Storage
Memory Allocation 1Memory Allocation 2
Memory ManagementMemory Management Paging 1
Memory Management Paging 2Memory Management Segmentation
Memory Management Swapping 1Memory Management Swapping 2
Multi Threading ModelsMultimedia System Compression 1
Multimedia System Compression 2Multimedia System Compression 3
Multimedia System Cpu Disk SchedulingMultimedia System Network Management
Network File System 1Network File System 2
Network Structure TopologyOperating System
Process Control BlockProcess Creation
Process RpcProcess Scheduling Queue
Process StructuresProcess Sync Monitors
Process SynchronizationProcesses
Protection Access MatrixProtection Concepts
Protection Memory ProtectionProtection Revocation Access Rights
RobustnessRtos
Secondary StorageSecurity
Security CryptographySecurity Intrusion Detection
Security Program System ThreatsSecurity System Facility
Security User AuthenticationSemaphores 1
Semaphores 2Swap Space Management
ThreadsThreads Cancellation
Threads Fork ExecThreads Pools
Threads Signal HandlingThreads Ult Klt
Two Port NetworkVirtual Memory
Virtual Memory Demand PagingVirtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing
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
Read more about this MCQ
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
Read more about this MCQ
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
Read more about this MCQ
If deadlocks occur frequently, the detection algorithm must be invoked ________
A. Rarely
B. Frequently
C. Rarely & frequently
D. None of the mentioned
Read more about this MCQ
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
Read more about this MCQ
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
Read more about this MCQ