Operating System » Deadlock Recovery
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
A deadlock can be broken by ____________
A. Abort one or more processes to break the circular wait
B. Abort all the process in the system
C. Preempt all resources from all processes
D. None of the mentioned
Read more about this MCQ
The two ways of aborting processes and eliminating deadlocks are ____________
A. Abort all deadlocked processes
B. Abort all processes
C. Abort one process at a time until the deadlock cycle is eliminated
D. All of the mentioned
Read more about this MCQ
Those processes should be aborted on occurrence of a deadlock, the termination of which?
A. Is more time consuming
B. Incurs minimum cost
C. Safety is not hampered
D. All of the mentioned
Read more about this MCQ
The process to be aborted is chosen on the basis of the following factors?
A. Priority of the process
B. Process is interactive or batch
C. How long the process has computed
D. All of the mentioned
Read more about this MCQ
Cost factors for process termination include ____________
A. Number of resources the deadlock process is not holding
B. Cpu utilization at the time of deadlock
C. Amount of time a deadlocked process has thus far consumed during its execution
D. All of the mentioned
Read more about this MCQ
To _______ to a safe state, the system needs to keep more information about the states of processes.
A. Abort the process
B. Roll back the process
C. Queue the process
D. None of the mentioned
Read more about this MCQ
What is the solution to starvation?
A. The number of rollbacks must be included in the cost factor
B. The number of resources must be included in resource preemption
C. Resource preemption be done instead
D. All of the mentioned
Read more about this MCQ