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 2
Show/Hide Answers
OS Deadlocks
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.
minimum
average
maximum
approximate
Author:
rikazzz
Comment
OS Deadlocks
For non sharable resources like a printer, mutual exclusion ____________
must exist
must not exist
may exist
none of the mentioned
A printer cannot be simultaneously shared by several processes.
Author:
rikazzz
Comment
OS Deadlocks
A state is safe, if ____________
the system does not crash due to deadlock occurrence
the system can allocate resources to each process in some order and still avoid a deadlock
the state keeps the system protected and safe
all of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
The circular wait condition can be prevented by ____________
defining a linear ordering of resource types
using thread
using pipes
all of the mentioned
Author:
rikazzz
Comment
OS Deadlocks
A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.
resource allocation state
system storage state
operating system
resources
Resource allocation states are used to maintain the availability of the already and current available resources.
Author:
rikazzz
Comment
OS Deadlocks
The number of resources requested by a process ____________
must always be less than the total number of resources available in the system
must always be equal to the total number of resources available in the system
must not exceed the total number of resources available in the system
must exceed the total number of resources available in the system
Author:
rikazzz
Comment
OS Deadlocks
An edge from process Pi to Pj in a wait for graph indicates that ____________
Pi is waiting for Pj to release a resource that Pi needs
Pj is waiting for Pi to release a resource that Pj needs
Pi is waiting for Pj to leave the system
Pj is waiting for Pi to leave the system
Author:
rikazzz
Comment
OS Deadlocks
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
Author:
rikazzz
Comment
OS Deadlocks
If the resources are always preempted from the same process __________ can occur.
deadlock
system crash
aging
starvation
Author:
rikazzz
Comment
OS Deadlocks
If the wait for graph contains a cycle ____________
then a deadlock does not exist
then a deadlock exists
then the system is in a safe state
either deadlock exists or system is in a safe state
Author:
rikazzz
Comment
Page navigation
Previous Page
Previous
1
2
3
4
…
6
Next Page
Next
Go to Page
Light
Dark
GK
Pakistan Studies
Current Affairs
Islamic Studies
English