Skip to content
MCQtimes.com
GK
Pakistan Studies
Current Affairs
Islamic Studies
English
MCQtimes.com
Toggle Menu
OS Deadlocks
Home
/
Computer Science
/
Operating System
/
OS Deadlocks
- Page 3
Show/Hide Answers
OS Deadlocks
The request and release of resources are ___________
command line statements
interrupts
system calls
special programs
Author:
rikazzz
Comment
OS Deadlocks
Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
resource allocation graph
starvation graph
inversion graph
none of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
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?
2
3
4
1
Author:
rikazzz
Comment
OS Deadlocks
Cost factors for process termination include ____________
Number of resources the deadlock process is not holding
CPU utilization at the time of deadlock
Amount of time a deadlocked process has thus far consumed during its execution
All of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
The disadvantage of a process being allocated all its resources before beginning its execution is ____________
Low CPU utilization
Low resource utilization
Very high resource utilization
None of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
The data structures available in the Banker’s algorithm are ____________
Available
Need
Allocation
All of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
Which one of the following is the deadlock avoidance algorithm?
banker’s algorithm
round-robin algorithm
elevator algorithm
karn’s algorithm
Author:
rikazzz
Comment
OS Deadlocks
The content of the matrix Need is ____________
Allocation – Available
Max – Available
Max – Allocation
Allocation – Max
Author:
rikazzz
Comment
OS Deadlocks
The Banker’s algorithm is _____________ than the resource allocation graph algorithm.
less efficient
more efficient
equal
none of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
The wait-for graph is a deadlock detection algorithm that is applicable when ____________
all resources have a single instance
all resources have multiple instances
all resources have a single 7 multiple instances
all of the mentioned
Author:
rikazzz
Comment
Page navigation
Previous Page
Previous
1
2
3
4
5
6
Next Page
Next
Go to Page
Light
Dark
GK
Pakistan Studies
Current Affairs
Islamic Studies
English