Final answer:
The statement that deadlock avoidance is more restrictive than deadlock prevention is true. Avoidance requires constant monitoring and careful resource allocation to prevent entering a state that could lead to deadlock, using methods like the Banker's algorithm.
Step-by-step explanation:
The statement 'Deadlock avoidance is more restrictive than deadlock prevention.' is True. Deadlock avoidance and deadlock prevention are two strategies used to handle deadlocks in a multiprocessing environment. Deadlock avoidance involves careful resource allocation, ensuring that a system never enters an unsafe state where a deadlock is possible. It uses algorithms such as the Banker's algorithm to preemptively avoid deadlocks by not allowing processes to start if they could lead to deadlocks.
On the other hand, deadlock prevention takes a more relaxed approach by preventing one of the four necessary conditions for a deadlock (mutual exclusion, hold and wait, no preemption, and circular wait) from occurring. Although both strategies aim to handle deadlocks, avoidance is considered more restrictive since it must constantly monitor the resource state and process requests, while prevention simply removes the possibility of a deadlock by ensuring that at least one of the conditions cannot arise.