Question 1

What are the three general ways that a deadlock can be handled?

Accepted Answer

A deadlock can be prevented by using pro

Question 2

Which of the following data structures in the banker's algorithm is a vector of length m, where m is the number of resource types?

Accepted Answer

A)  Need 
B)  Allocation 
C)  Max 
D)  Available 
A)  Need 
B)  Allocation 
C)  Max 
D)  Available

Question 3

In a system resource-allocation graph, ____.

Accepted Answer

A)  a directed edge from a process to a resource is called an assignment edge 
B)  a directed edge from a resource to a process is called a request edge 
C)  a directed edge from a process to a resource is called a request edge 
D)  None of the above 
A)  a directed edge from a process to a resource is called an assignment edge 
B)  a directed edge from a resource to a process is called a request edge 
C)  a directed edge from a process to a resource is called a request edge 
D)  None of the above

Question 4

Which of the following is not a factor in choosing which process to terminate during recovery from a deadlock?

Accepted Answer

A)  Who the parent of the process is. 
B)  How many more resources the process needs in order to complete. 
C)  How many processes will need to be terminated. 
D)  What the priority of the process is 
A)  Who the parent of the process is. 
B)  How many more resources the process needs in order to complete. 
C)  How many processes will need to be terminated. 
D)  What the priority of the process is

Question 5

The circular-wait condition for a deadlock implies the hold-and-wait condition.

Accepted Answer

A) True 
 B)False

Question 6

Describe two methods for eliminating deadlock by aborting a process.

Accepted Answer

The first method is to abort all deadloc

Question 7

In the livelock example shown in Figure 8.2,

Accepted Answer

A)  a livelock is guaranteed to occur. 
B)  a livelock may occur sometime. 
C)  a livelock may occur sometime only if there are more than one instances of thread_one and thread_two are running. 
D)  a livelock is guaranteed to occur as long as there are more than one instances of thread_one and thread_two are running. 
A)  a livelock is guaranteed to occur. 
B)  a livelock may occur sometime. 
C)  a livelock may occur sometime only if there are more than one instances of thread_one and thread_two are running. 
D)  a livelock is guaranteed to occur as long as there are more than one instances of thread_one and thread_two are running.

Question 8

In the deadlock example shown in Figure 8.1,

Accepted Answer

A)  a deadlock is guaranteed to occur. 
B)  a deadlock may occur sometime, but not necessarily every time. 
C)  a deadlock may occur sometime only if there are more than one instances of thread_one and thread_two are running. 
D)  a deadlock is guaranteed to occur as long as there are more than one instances of thread_one and thread_two are running. 
A)  a deadlock is guaranteed to occur. 
B)  a deadlock may occur sometime, but not necessarily every time. 
C)  a deadlock may occur sometime only if there are more than one instances of thread_one and thread_two are running. 
D)  a deadlock is guaranteed to occur as long as there are more than one instances of thread_one and thread_two are running.

Question 9

A claim edge in a resource-allocation graph indicates that

Accepted Answer

A)  a process has been allocated a resource. 
B)  a process may request a resource. 
C)  a process may release a resource that it has already been assigned. 
D)  a process has requested a resource. 
A)  a process has been allocated a resource. 
B)  a process may request a resource. 
C)  a process may release a resource that it has already been assigned. 
D)  a process has requested a resource.

Question 10

What factors influence the decision of when to invoke a detection algorithm?

Accepted Answer

The first factor is how often a deadlock

Question 11

In a system resource-allocation graph, ____.

Accepted Answer

A)  a directed edge from a resource to a process is called an assignment edge 
B)  a directed edge from a resource to a process is called a request edge 
C)  a directed edge from a process to a resource is called an assignment edge 
D)  None of the above 
A)  a directed edge from a resource to a process is called an assignment edge 
B)  a directed edge from a resource to a process is called a request edge 
C)  a directed edge from a process to a resource is called an assignment edge 
D)  None of the above

Question 12

A system will never enter a deadlocked state if

Accepted Answer

A)  the system chooses to ignore the problem altogether. 
B)  the system uses the detection and recovery technique. 
C)  the system uses the deadlock avoidance technique. 
D)  None of the above. 
A)  the system chooses to ignore the problem altogether. 
B)  the system uses the detection and recovery technique. 
C)  the system uses the deadlock avoidance technique. 
D)  None of the above.

Question 13

Name three issues that need to be addressed if a preemption is required to deal with deadlocks.

Accepted Answer

First, the order of resources and proces

Question 14

Deadlock prevention and deadlock avoidance are essentially the same approaches for handling deadlock.

Accepted Answer

A) True 
 B)False

Question 15

One necessary condition for deadlock is ____, which states that at least one resource must be held in a nonsharable mode.

Accepted Answer

A)  hold and wait 
B)  mutual exclusion 
C)  circular wait 
D)  no preemption 
A)  hold and wait 
B)  mutual exclusion 
C)  circular wait 
D)  no preemption

Question 16

A system in an unsafe state will ultimately deadlock.

Accepted Answer

A) True 
 B)False

Question 17

The banker's algorithm is useful in a system with multiple instances of each resource type.

Accepted Answer

A) True 
 B)False

Question 18

Which of the following statement is true?

Accepted Answer

A)  An unsafe state is a deadlocked state. 
B)  A deadlocked state is a safe state. 
C)  An unsafe state will lead to a deadlocked state. 
D)  An unsafe state may lead to a deadlocked state. 
A)  An unsafe state is a deadlocked state. 
B)  A deadlocked state is a safe state. 
C)  An unsafe state will lead to a deadlocked state. 
D)  An unsafe state may lead to a deadlocked state.

Question 19

One necessary condition for deadlock is ______, which states that there is a chain of waiting processes whereby P0 is waiting for a resource held by P1, P1 is waiting for a resource held by P2, and Pn is waiting for a resource held by P0.

Accepted Answer

A)  hold and wait 
B)  mutual exclusion 
C)  circular wait 
D)  no preemption 
A)  hold and wait 
B)  mutual exclusion 
C)  circular wait 
D)  no preemption

Question 20

Suppose that there are ten resources available to three processes. At time 0, the following data is collected. The table indicates the process, the maximum number of resources needed by the process, and the number of resources currently owned by each process. Process Maximum Needs Currently Owned
P0 10 4
P1 3 1
P2 5 4
At time 1, P1 requests a resource. Which of the following is correct?

Accepted Answer

A)  The request will be granted, since the current state is safe. 
B)  The request will not be granted, since the current state is not safe. 
C)  The request will be granted, since the state after granting the request will be safe. 
D)  The request will not be granted, since the state after granting the request will be unsafe. 
A)  The request will be granted, since the current state is safe. 
B)  The request will not be granted, since the current state is not safe. 
C)  The request will be granted, since the state after granting the request will be safe. 
D)  The request will not be granted, since the state after granting the request will be unsafe.

What are the three general ways that a deadlock can be handled?

Which of the following data structures in the banker's algorithm is a vector of length m, where m is the number of resource types?

In a system resource-allocation graph, ____.

Which of the following is not a factor in choosing which process to terminate during recovery from a deadlock?

The circular-wait condition for a deadlock implies the hold-and-wait condition.

Describe two methods for eliminating deadlock by aborting a process.

In the livelock example shown in Figure 8.2,

In the deadlock example shown in Figure 8.1,

A claim edge in a resource-allocation graph indicates that

What factors influence the decision of when to invoke a detection algorithm?

In a system resource-allocation graph, ____.

A system will never enter a deadlocked state if

Name three issues that need to be addressed if a preemption is required to deal with deadlocks.

Deadlock prevention and deadlock avoidance are essentially the same approaches for handling deadlock.

One necessary condition for deadlock is ____, which states that at least one resource must be held in a nonsharable mode.

A system in an unsafe state will ultimately deadlock.

The banker's algorithm is useful in a system with multiple instances of each resource type.

Which of the following statement is true?

One necessary condition for deadlock is ______, which states that there is a chain of waiting processes whereby P₀ is waiting for a resource held by P₁, P₁ is waiting for a resource held by P₂, and P_n is waiting for a resource held by P₀.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Tools

Synchronization Examples

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Exam 8: Deadlocks

What are the three general ways that a deadlock can be handled?

Which of the following data structures in the banker's algorithm is a vector of length m, where m is the number of resource types?

In a system resource-allocation graph, ____.

Which of the following is not a factor in choosing which process to terminate during recovery from a deadlock?

The circular-wait condition for a deadlock implies the hold-and-wait condition.

Describe two methods for eliminating deadlock by aborting a process.

In the livelock example shown in Figure 8.2,

In the deadlock example shown in Figure 8.1,

A claim edge in a resource-allocation graph indicates that

What factors influence the decision of when to invoke a detection algorithm?

In a system resource-allocation graph, ____.

A system will never enter a deadlocked state if

Name three issues that need to be addressed if a preemption is required to deal with deadlocks.

Deadlock prevention and deadlock avoidance are essentially the same approaches for handling deadlock.

One necessary condition for deadlock is ____, which states that at least one resource must be held in a nonsharable mode.

A system in an unsafe state will ultimately deadlock.

The banker's algorithm is useful in a system with multiple instances of each resource type.

Which of the following statement is true?

One necessary condition for deadlock is ______, which states that there is a chain of waiting processes whereby P0 is waiting for a resource held by P1, P1 is waiting for a resource held by P2, and Pn is waiting for a resource held by P0.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Cpu Scheduling

Synchronization Tools

Synchronization Examples

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

One necessary condition for deadlock is ______, which states that there is a chain of waiting processes whereby P₀ is waiting for a resource held by P₁, P₁ is waiting for a resource held by P₂, and P_n is waiting for a resource held by P₀.