Operating System » Deadlock Prevention
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 number of resources requested by a process ____________
A. Must always be less than the total number of resources available in the system
B. Must always be equal to the total number of resources available in the system
C. Must not exceed the total number of resources available in the system
D. Must exceed the total number of resources available in the system
Read more about this MCQ
The request and release of resources are ___________
A. Command line statements
B. Interrupts
C. System calls
D. Special programs
Read more about this MCQ
What are Multithreaded programs?
A. Lesser prone to deadlocks
B. More prone to deadlocks
C. Not at all prone to deadlocks
D. None of the mentioned
Read more about this MCQ
For a deadlock to arise, which of the following conditions must hold simultaneously?
A. Mutual exclusion
B. No preemption
C. Hold and wait
D. All of the mentioned
Read more about this MCQ
For Mutual exclusion to prevail in the system ____________
A. At least one resource must be held in a non sharable mode
B. The processor must be a uniprocessor rather than a multiprocessor
C. There must be at least one resource in a sharable mode
D. All of the mentioned
Read more about this MCQ
For a Hold and wait condition to prevail ____________
A. A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it
B. A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
C. A process must hold at least one resource and not be waiting to acquire additional resources
D. None of the mentioned
Read more about this MCQ
Deadlock prevention is a set of methods ____________
A. To ensure that at least one of the necessary conditions cannot hold
B. To ensure that all of the necessary conditions do not hold
C. To decide if the requested resources for a process have to be given or not
D. To recover from a deadlock
Read more about this MCQ
For non sharable resources like a printer, mutual exclusion ____________
A. Must exist
B. Must not exist
C. May exist
D. None of the mentioned
Read more about this MCQ
For sharable resources, mutual exclusion ____________
A. Is required
B. Is not required
C. May be or may not be required
D. None of the mentioned
Read more about this MCQ
To ensure that the hold and wait condition never occurs in the system, it must be ensured that ____________
A. Whenever a resource is requested by a process, it is not holding any other resources
B. Each process must request and be allocated all its resources before it begins its execution
C. A process can request resources only when it has none
D. All of the mentioned
Read more about this MCQ