DEADLOCK TRUE OR FALSE

Question

A) DEADLOCK CAN BE PREVENTED BY NOT ALLOWING ANY PROCESS TO REQUEST FOR RESOURCE WHEN IT ENTERS A CRITICAL SECTION.(TRUE OR FALSE)

B) DEADLOCK AVOIDANCE SCHEME REQUIRE INFORMATION CONCERNING WHICH RESOURCE A PROCESS WILL REQUEST AND USE DURING ITS LIFE TIME(TRUE OR FALSE)

ALSO PROVIDE SOME REASON

Answer 1

1) DEADLOCK CAN BE PREVENTED BY NOT ALLOWING ANY PROCESS TO REQUEST FOR RESOURCE WHEN IT ENTERS A CRITICAL SECTION.(TRUE OR FALSE) ----- FALSE

the correct statement is 

DEADLOCK CAN BE PREVENTED BY NOT ALLOWING ANY PROCESS TO REQUEST FOR RESOURCE WHEN IT ENTERS A UNSAFE state

points:-

i) if a process enter into a critical section, there never happens of deadlock

ii) All UNSAFE states doesn't lead Deadlocks, but for preventing deadlock, we never allow a process to request for resource when it enters into a Unsafe state ( UNSAFE sequence )

---

2) DEADLOCK AVOIDANCE SCHEME REQUIRE INFORMATION CONCERNING WHICH RESOURCE A PROCESS WILL REQUEST AND USE DURING ITS LIFE TIME(TRUE OR FALSE) ----- TRUE

DEADLOCK AVOIDANCE means Bankers algorithm, in Bankers algorithm we have to know MAXIMUM DEMAND DURING ITS LIFE TIME