Operating system mcqs deadlock avoidance
Click on any option to know the CORRECT ANSWERS
A system is in a safe state only if there exists a .....
all of the mentioned
A deadlock avoidance algorithm dynamically examines the ..... to ensure that a circular wait condition can never exist.
resource allocation state
system storage state
Question 2 Explanation:
Resource allocation states are used to maintain the availability of the already and current available resources.
Given a priori information about the ..... number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
The content of the matrix Need is .....
Allocation - Available
Max - Available
Max - Allocation
Allocation - Max
A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. Process P0 P1 P2 Maximum needs (process-wise: P0 through P2 top to bottom) 10 4 9 Currently allocated (process-wise) 5 2 2 Which of the following sequence is a safe sequence?
P0, P1, P2
P1, P2, P0
P2, P0, P1
P1, P0, P2
There are 5 questions to complete.