NEW
Font size
WorksheetsProblema del deadlock
Total questions: 25
Worksheet time: 25mins
What is the graph used for deadlock identification
resource allocation graph
process allocation graph
thread allocation graph
instance allocation graph
Which of the following condition is required for deadlock to be possible?
mutual exclusion
a process may hold allocated resources while awaiting assignment of other resources
no resource can be forcibly removed from a process holding it
all of the mentioned
Which of the following is not a necessary condition for deadlock?
Mutual Exclusion
Reentrancy
Hold and wait
No pre-emption
If any of the process is waiting for a long time then it is called as
Deadlock
semaphore
starvation
None
Only one thread at a time can use a resource
mutual exclusion
hold and wait
no preemption
CIRCULAR WAIT
A set of process or thread waits for a resource which is held by another waiting process is called
Deadlock
starvation
synchronization
concurrency
Resources are released only voluntarily by the thread holding the resource, after thread is finished with it
mutual exclusion
hold and wait
no preemption
circular wait
Thread holding at least one resource is waiting to acquire additional resources held by other threads are called as
hold and wait
no preemption
circular wait
mutual exclusion
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is
6
7
8
9
Consider a system having m resources of the same type. These resources are shared by 3 processes A, B, C which have peak time demands of 3, 4, 6 respectively. The minimum value of m that ensures deadlock will never occur is
11
12
13
14
Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be requested and released only one at a time. The largest value of K that will always avoid deadlock is _______ .
1
2
3
4
A system is in the safe state if ____________
the system can allocate resources to each process in some order and still avoid a deadlock
there exist a safe sequence
all of the mentioned
none of the mentioned
The circular wait condition can be prevented by ____________
defining a linear ordering of resource types
using thread
using pipes
all of the mentioned
Which one of the following is the deadlock avoidance algorithm?
banker’s algorithm
round-robin algorithm
elevator algorithm
karn’s algorithm
A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________
deadlock
starvation
inversion
aging
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
Multithreaded programs are :
lesser prone to deadlocks
more prone to deadlocks
not at all prone to deadlocks
None of these
Deadlock prevention is a set of methods :
to ensure that at least one of the necessary conditions cannot hold
to ensure that all of the necessary conditions do not hold
to decide if the requested resources for a process have to be given or not
to recover from a deadlock
For non sharable resources like a printer, mutual exclusion
must exist
must not exist
may exist
None of these
To ensure that the hold and wait condition never occurs in the system, it must be ensured that :
whenever a resource is requested by a process, it is not holding any other resources
each process must request and be allocated all its resources before it begins its execution
a process can request resources only when it has none
All of these
The disadvantage of a process being allocated all its resources before beginning its execution is :
A. B. C. D.
Low CPU utilization
Low resource utilization
Very high resource utilization
None of these
With deadlock detection, requested resources are granted to
Resources
Programs
Processes
Users
A set of resources' allocations such that the system can allocate resources to each process in some order, and still avoid a deadlock is called ________.
Unsafe state
Safe state
Starvation
Greedy Allocation
A process is starved
if it is permanently waiting for a resource
if semaphores are not used
if a queue is not used for scheduling
if demand paging is not properly implemented
The Banker's algorithm is used
to prevent deadlock in operating systems
to detect deadlock in operating systems
to rectify a deadlocked state
none of the above
