Chapter 26 Flashcards

1
Q

When in a bridge crossing problem, a lane of cars jammed and whole car lane goes back, what it is technically called

A

preempt the resource or roll back

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

Does starvation possible in bridge crossing

A

Yes

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

How a process utilize a resource

A

request -> use -> release

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

What is system model

A

In system model there are some processes and there are some resources. Processes uses resources and at the end they release resources.

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

Does resource type instances are identical to each other

A

Yes

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

What 4 conditions that become true to create a deadlocks

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

What is Mutual Exclusion

A

Every process using a resource mutually exclusively. Means not sharing the resource. Only one process can use a resource at a time.

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

What is no preemption

A

A process has a resource but it can not be preempt. It means resource can not be taken from it by force and give to some one else.

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

What is hold and wait

A

A process has a resource and wants that another process give him his resource.

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

What is circular wait

A

Processes are waiting in a circle. All processes want resource from another process.

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

What is resource allocation graph

A

We can know from it, when the system has a deadlock

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

What is deadlock prevention

A

If any of one condition among 4 conditions does not exists, then it is called deadlock prevention.

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

What are 2 things in edge set of resource allocation graph

A
  1. Request edges

2. Assignment edges

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

What is assignment edge in resource allocation graph

A

Instance assignment to process

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

What is request edge in resource allocation graph

A

From a process to a resource type

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

If graph contains no cycle then no deadlock.

True/False

A

True

17
Q

If graph contains a cycle and if only one instance per resource type, then deadlock
True/False

A

True

18
Q

If graph contains a cycle and if several instances per resource type, possibility of deadlock
True/False

A

True