Chapter 27 Flashcards

1
Q

What is deadlock handling

A
  • Deadlock prevention
  • Deadlock avoidance
  • Deadlock detection and recovery
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is low resources utilization

A

When a process request all of its resource, and when he is able to receive all of them then start utilizing. It is low resources utilization.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is Deadlock prevention

A

In Deadlock prevention, we try to prevent any one of the four conditions that are necessary to deadlock to occur. i.e.

  1. Circular wait
  2. Mutual exclusion
  3. Hold and wait
  4. No Preemption
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is Deadlock avoidance

A

A safe sequence of processes and allocation of resources ensures a safe state. Deadlock avoidance algorithms try not to allocate resources to a process if it will make the system in an unsafe state.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Does deadlock avoidance ensures that there can never be a circular-wait condition

A

Yes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is safe state

A

System is in a safe state if all process exists in a safe sequence.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is safe sequence

A

The order in which we finish the execution of all process of a system is called safe sequence.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

If system is in safe state then there can not be deadlock and if system is in unsafe state then there is possibility of deadlock. True/false

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly