If the wait for graph contains a cycle :
A) then a deadlock does not exist
B) then a deadlock exists
C) then the system is in a safe state
D) either deadlock exists or system is in a safe state
Correct Answer:
Verified
Q14: A system is in the safe state
Q15: The circular wait condition can be prevented
Q16: Which one of the following is the
Q17: What is the drawback of banker's algorithm?
A)in
Q18: To avoid deadlock
A)there must be a fixed
Q20: All unsafe states are :
A)deadlocks
B)not deadlocks
C)fatal
D)none of
Q21: Physical memory is broken into fixed-sized blocks
Q22: Logical memory is broken into blocks of
Q23: The _ is used as an index
Q24: _ is the concept in which a
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents