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 5
Show/Hide Answers
OS Deadlocks
Which of the following condition is required for a 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
Author:
rikazzz
Comment
OS Deadlocks
A problem encountered in multitasking when a process is perpetually denied necessary resources is called ____________
deadlock
starvation
inversion
aging
Author:
rikazzz
Comment
OS Deadlocks
What are Multithreaded programs?
lesser prone to deadlocks
more prone to deadlocks
not at all prone to deadlocks
none of the mentioned
Multiple threads can compete for shared resources.
Author:
rikazzz
Comment
OS Deadlocks
What is the disadvantage of invoking the detection algorithm for every request?
overhead of the detection algorithm due to consumption of memory
excessive time consumed in the request to be allocated memory
considerable overhead in computation time
all of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
For Mutual exclusion to prevail in the system ____________
at least one resource must be held in a non sharable mode
the processor must be a uniprocessor rather than a multiprocessor
there must be at least one resource in a sharable mode
all of the mentioned
If another process requests that resource (non – shareable resource), the requesting process must be delayed until the resource has been released.
Author:
rikazzz
Comment
OS Deadlocks
For sharable resources, mutual exclusion ____________
is required
is not required
may be or may not be required
none of the mentioned
They do not require mutually exclusive access, and hence cannot be involved in a deadlock.
Author:
rikazzz
Comment
OS Deadlocks
What is the solution to starvation?
the number of rollbacks must be included in the cost factor
the number of resources must be included in resource preemption
resource preemption be done instead
all of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
If no cycle exists in the resource allocation graph ____________
then the system will not be in a safe state
then the system will be in a safe state
all of the mentioned
none of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
One way to ensure that the circular wait condition never holds is to ____________
impose a total ordering of all resource types and to determine whether one precedes another in the ordering
to never let a process acquire resources that are held by other processes
to let a process wait for only one resource at a time
all of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
The resource allocation graph is not applicable to a resource allocation system ____________
with multiple instances of each resource type
with a single instance of each resource type
single & multiple instances of each resource type
none of the mentioned
Author:
rikazzz
Comment
Page navigation
Previous Page
Previous
1
…
3
4
5
6
Next Page
Next
Go to Page
Light
Dark
GK
Pakistan Studies
Current Affairs
Islamic Studies
English