Test
Banker's algorithm: safe states and deadlocks
Preguntas del test (1)
1Which of the following statements are true about Bankers algorithm?
- AA safe state implies that a deadlock can never occur in any future state.
- BBanker's algorithm checks the Coffman conditions to find deadlocks.
- CBanker's algorithm guarantees freedom from starvation.
- DBanker's algorithm requires a priori knowledge of the resource demands of every involved process.
Información
- Descripción
- Test sobre Sin título, creado por Tamara Juric el 06/08/2022.
- Autor
- Tamara Juric
- Idioma
- English
- Visitas
- 0
- Valoración
- Aún sin valoraciones Valora este test