ACounting semaphore can be used to control access to finite number of instances of a resource
BReader writers problem typically arises when several concurrent processes share the data base
CBanker's algorithm prevents dead lock
DA computer system is in a safe state only if there exists a safe sequence
Show answerHide answer
Correct answer: (C) Banker's algorithm prevents dead lock
Explanation
The banker's algorithm avoids deadlock (by checking for a safe state); it does not prevent it. Prevention means removing one of the four necessary conditions.