Quiz #5

Question 1		Multiple Answer	(1 points)
	Question:	The condition that a process may hold a resource while awaiting assignment of additional resources
		is called the "transitive wait" condition is called the "hold and wait" condition is called the "circular wait" condition is one of the necessary conditions for deadlock is impossible with ordered resource allocation

Question 2 Multiple Answer (1 points)

Question: The condition that only one process may use a resource at a time

is called "mutual exclusion"
is called the "hold and wait" condition
is one of the necessary conditions for deadlock
is called "blocking"
is called "preemption"

Question 3 Multiple Answer (1 points)

Question: The condition that a resource cannot be forcibly taken away from a process that is holding it.

is called "no preemption"
is called "mutual exclusion"
is one of the necessary conditions for deadlock
is called "blocking"
is called "starvation"

Question 4 Multiple Answer (1 points)

Question: The condition that cycle exists in the wait-for relation between processes.

is called the "hold and wait" condition
is one of the necessary conditions for deadlock
is called the "no preemption condition"
is called "transitive blocking"
is not possible with ordered resource allocation
is not possible without the "hold and wait" condition

Question 5 True / False (1 points)

Question: Deadlock is possible if any one of the four necessary conditions holds.

True
False

Question 6 True / False (1 points)

Question: Deadlock avoidance means the same thing as deadlock prevention.

True
False

Question 7 True / False (1 points)

Question: If resources are assigned numbers and required to be requested in order, so that a process cannot hold a higher-numbered resource while it requests a lowered number resource, deadlock is not possible.

True
False

Question 8 True / False (1 points)

Question: Once a system is in an unsafe state (according to the meaning of the term as used in the banker's algorithm) eventual deadlock is certain.

True
False

Question 9 True / False (1 points)

Question: Once a system is in an unsafe state (as the term is used in the banker's algorithm) there is at least one sequence of process requests that will unavoidably lead to deadlock.

True
False

Question 10 Multiple Answer (1 points)

Question: Which of the following are true of deadlock avoidance?

it may be necessary to preempt and roll back processes
the maximum resource requirements of processes must be declared in advance
there must be a fixed number of resources to allocate
processes must be independent, i.e., not constrained by any execution ordering or interprocess synchronization requirements
is the same thing as deadlock prevention

Question 11 Matching (1 points)

Question: Match up the examples with the type or resource (consumable or reusable).

Match Question Items

1. message

2. unix signal

3. mutex

4. semaphore

5. processor

6. tape drive

7. hardware interrupt

8. memory space

9. data in an I/Obuffer

10. termination status of another process

Answer Items

A. reusable resource

B. consumable resource

Question 12 Multiple Choice (1 points)

Question: Which of the following ways of dealing with deadlock applies best to the allocation of main memory resources?

the banker's algorithm
preemption
detection and recovery
ordered resource allocation
request all resources at one time
process initiation denial

Question 13 Multiple Choice (1 points)

Question: Which of the following ways of dealing with deadlock applies best to mutexes and monitors?

the banker's algorithm
preemption
rollback
ordered resource allocation
request all resources at the same time
process initiation denial

Question 14 Multiple Choice (1 points)

Question: For which of the following kinds of resources would deadlock avoidance be most likely to work well?

messages
main memory
semaphores
tape drives

Question 15 Multiple Choice (1 points)

Question: One algorithm simulates the future execution of the system, based on the assumption that every unblocked process will eventually complete and release its resources, to see if under this assumption all processes can complete. This is used for

deadlock prevention
deadlock avoidance
deadlock detection
deadlock minimization

Question 16 Multiple Choice (1 points)

Question: One algorithm simulates the possible future execution of the system, based on the assumption that every process will only complete after its declared maximum total resource allocations have all been satisifed, to see if the maximum future requests of all processes can be satisfied and so they will all be able to complete. This is used for

deadlock prevention
deadlock avoidance
deadlock detection
deadlock minimization

Question 17 True / False (1 points)

Question: Deadlock is not possible with reader/writer locks.

True
False

Question 18 True / False (1 points)

Question: Once a deadlock is detected, the problem can be solved by suspending one or more of the deadlocked processes.

True
False

Question 19 True / False (1 points)

Question: Operating systems are designed to prevent, avoid, or detect all possible deadlocks.

True
False

Question 20 True / False (1 points)

Question: A deadlock can involve a combination of reusable and consumable resources.

True
False

Question 2		Multiple Answer	(1 points)
	Question:	The condition that only one process may use a resource at a time
		is called "mutual exclusion" is called the "hold and wait" condition is one of the necessary conditions for deadlock is called "blocking" is called "preemption"

Question 3		Multiple Answer	(1 points)
	Question:	The condition that a resource cannot be forcibly taken away from a process that is holding it.
		is called "no preemption" is called "mutual exclusion" is one of the necessary conditions for deadlock is called "blocking" is called "starvation"

Question 4		Multiple Answer	(1 points)
	Question:	The condition that cycle exists in the wait-for relation between processes.
		is called the "hold and wait" condition is one of the necessary conditions for deadlock is called the "no preemption condition" is called "transitive blocking" is not possible with ordered resource allocation is not possible without the "hold and wait" condition

Question 5		True / False	(1 points)
	Question:	Deadlock is possible if any one of the four necessary conditions holds.
		True False

Question 6		True / False	(1 points)
	Question:	Deadlock avoidance means the same thing as deadlock prevention.
		True False

Question 7		True / False	(1 points)
	Question:	If resources are assigned numbers and required to be requested in order, so that a process cannot hold a higher-numbered resource while it requests a lowered number resource, deadlock is not possible.
		True False

Question 8		True / False	(1 points)
	Question:	Once a system is in an unsafe state (according to the meaning of the term as used in the banker's algorithm) eventual deadlock is certain.
		True False

Question 9		True / False	(1 points)
	Question:	Once a system is in an unsafe state (as the term is used in the banker's algorithm) there is at least one sequence of process requests that will unavoidably lead to deadlock.
		True False

Question 10		Multiple Answer	(1 points)
	Question:	Which of the following are true of deadlock avoidance?
		it may be necessary to preempt and roll back processes the maximum resource requirements of processes must be declared in advance there must be a fixed number of resources to allocate processes must be independent, i.e., not constrained by any execution ordering or interprocess synchronization requirements is the same thing as deadlock prevention

Question 12		Multiple Choice	(1 points)
	Question:	Which of the following ways of dealing with deadlock applies best to the allocation of main memory resources?
		the banker's algorithm preemption detection and recovery ordered resource allocation request all resources at one time process initiation denial

Question 13		Multiple Choice	(1 points)
	Question:	Which of the following ways of dealing with deadlock applies best to mutexes and monitors?
		the banker's algorithm preemption rollback ordered resource allocation request all resources at the same time process initiation denial

Question 14		Multiple Choice	(1 points)
	Question:	For which of the following kinds of resources would deadlock avoidance be most likely to work well?
		messages main memory semaphores tape drives

Question 15		Multiple Choice	(1 points)
	Question:	One algorithm simulates the future execution of the system, based on the assumption that every unblocked process will eventually complete and release its resources, to see if under this assumption all processes can complete. This is used for
		deadlock prevention deadlock avoidance deadlock detection deadlock minimization

Question 16		Multiple Choice	(1 points)
	Question:	One algorithm simulates the possible future execution of the system, based on the assumption that every process will only complete after its declared maximum total resource allocations have all been satisifed, to see if the maximum future requests of all processes can be satisfied and so they will all be able to complete. This is used for
		deadlock prevention deadlock avoidance deadlock detection deadlock minimization

Question 17		True / False	(1 points)
	Question:	Deadlock is not possible with reader/writer locks.
		True False

Question 18		True / False	(1 points)
	Question:	Once a deadlock is detected, the problem can be solved by suspending one or more of the deadlocked processes.
		True False

Question 19		True / False	(1 points)
	Question:	Operating systems are designed to prevent, avoid, or detect all possible deadlocks.
		True False

Question 20		True / False	(1 points)
	Question:	A deadlock can involve a combination of reusable and consumable resources.
		True False