Deadlock Avoidance MCQs

13 MCQs — Operating System MCQs (Page 1 of 2)

Practice Deadlock Avoidance MCQs with correct answers and explanations. These questions are from the Operating System MCQs section.

Attempt Deadlock Avoidance Quiz

Operating System Subcategories

Application Io Interface 1	Application Io Interface 2
Atomic Transactions	Basics
Classic Sync Problems	Communication Systems Bandwidth Transmission Medium
Cpu Scheduling	Cpu Scheduling 2
Cpu Scheduling Algorithms 1	Cpu Scheduling Algorithms 2
Cpu Scheduling Benefits	Critical Section Problem
Deadlock	Deadlock Avoidance
Deadlock Detection	Deadlock Prevention
Deadlock Recovery	Disk Management
Disk Scheduling 1	Disk Scheduling 2
Distributed File System	Distributed Operating System
Distributed Synchronization	File System 1
File System Allocation Methods 1	File System Allocation Methods 2
File System Allocation Methods 3	File System Concepts
File System Free Space Performance	File System Implementation
File System Interface Access Methods 1	File System Interface Access Methods 2
File System Interface Directory Structure 1	File System Interface Directory Structure 2
File System Interface Mounting Sharing	File System Interface Protection
File System Recovery	Inter Process Communication
Io Subsystem	Kernel Io Subsystems
Linux	Mass Storage Raid 1
Mass Storage Raid 2	Mass Storage Tertiary Storage
Memory Allocation 1	Memory Allocation 2
Memory Management	Memory Management Paging 1
Memory Management Paging 2	Memory Management Segmentation
Memory Management Swapping 1	Memory Management Swapping 2
Multi Threading Models	Multimedia System Compression 1
Multimedia System Compression 2	Multimedia System Compression 3
Multimedia System Cpu Disk Scheduling	Multimedia System Network Management
Network File System 1	Network File System 2
Network Structure Topology	Operating System
Process Control Block	Process Creation
Process Rpc	Process Scheduling Queue
Process Structures	Process Sync Monitors
Process Synchronization	Processes
Protection Access Matrix	Protection Concepts
Protection Memory Protection	Protection Revocation Access Rights
Robustness	Rtos
Secondary Storage	Security
Security Cryptography	Security Intrusion Detection
Security Program System Threats	Security System Facility
Security User Authentication	Semaphores 1
Semaphores 2	Swap Space Management
Threads	Threads Cancellation
Threads Fork Exec	Threads Pools
Threads Signal Handling	Threads Ult Klt
Two Port Network	Virtual Memory
Virtual Memory Demand Paging	Virtual Memory Frame Allocation
Virtual Memory Page Replacement Algorithms 1	Virtual Memory Page Replacement Algorithms 2
Virtual Memory Thrashing

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.

A. Resource allocation state
B. System storage state
C. Operating system
D. Resources

Read more about this MCQ

Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.

A. Resources currently available
B. Processes that have previously been in the system
C. Resources currently allocated to each process
D. Future requests and releases of each process

Read more about this MCQ

Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.

A. Minimum
B. Average
C. Maximum
D. Approximate

Read more about this MCQ

A state is safe, if ____________

A. The system does not crash due to deadlock occurrence
B. The system can allocate resources to each process in some order and still avoid a deadlock
C. The state keeps the system protected and safe
D. All of the mentioned

Read more about this MCQ

A system is in a safe state only if there exists a ____________

A. Safe allocation
B. Safe resource
C. Safe sequence
D. All of the mentioned

Read more about this MCQ

All unsafe states are ____________

A. Deadlocks
B. Not deadlocks
C. Fatal
D. None of the mentioned

Read more about this MCQ

A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. advertisement Process P0 P1 P2 Maximum needs (process-wise: P0 through P2 top to bottom) 10 4 9 Currently allocated (process-wise) 5 2 2 Which of the following sequence is a safe sequence?

A. P0, p1, p2
B. P1, p2, p0
C. P2, p0, p1
D. P1, p0, p2

Read more about this MCQ

If no cycle exists in the resource allocation graph ____________

A. Then the system will not be in a safe state
B. Then the system will be in a safe state
C. All of the mentioned
D. None of the mentioned

Read more about this MCQ

The resource allocation graph is not applicable to a resource allocation system ____________

A. With multiple instances of each resource type
B. With a single instance of each resource type
C. Single & multiple instances of each resource type
D. None of the mentioned

Read more about this MCQ

The Banker’s algorithm is _____________ than the resource allocation graph algorithm.

A. Less efficient
B. More efficient
C. Equal
D. None of the mentioned

Read more about this MCQ

MCQs Menu

Deadlock Avoidance MCQs

Operating System Subcategories

MCQs Menu

Past Papers