Introduction

UNIT 3 : Distriuted Deadlock Detection
*Introduction
1. What is a reusable resource?

a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned
2. Which of the following condition is required for a deadlock to be possible?

a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other
resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned
3. A system is in the safe state if ____________

a) the system can allocate resources to each process in some order and still avoid
a deadlock
b) there exist a safe sequence
c) all of the mentioned
4. The circular wait condition can be prevented by ____________

a) defining a linear ordering of resource types
b) using thread
c) using pipes
5. Which one of the following is the deadlock avoidance algorithm?

a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm
6. What is the drawback of banker’s algorithm?

a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
7. For an effective operating system, when to check for deadlock?

a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
8. A problem encountered in multitasking when a process is perpetually denied

necessary resources is called ____________
a) deadlock
b) starvation
c) inversion
d) aging
9. Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
Answer: a
10. To avoid deadlock ____________

a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used
Answer: a
1. A deadlock can be broken by ____________
a) abort one or more processes to break the circular wait
b) abort all the process in the system
c) preempt all resources from all processes
View Answer
Answer: a
Explanation: None.
2. The two ways of aborting processes and eliminating deadlocks are ____________
a) Abort all deadlocked processes
b) Abort all processes
c) Abort one process at a time until the deadlock cycle is eliminated
d) All of the mentioned
View Answer
Answer: c
Explanation: None.
3. Those processes should be aborted on occurrence of a deadlock, the termination of

which?
a) is more time consuming
b) incurs minimum cost
c) safety is not hampered
View Answer
Answer: b
Explanation: None.
4. The process to be aborted is chosen on the basis of the following factors?

a) priority of the process
b) process is interactive or batch
c) how long the process has computed
View Answer
Answer: d
Explanation: None.
5. Cost factors for process termination include ____________

a) Number of resources the deadlock process is not holding
b) CPU utilization at the time of deadlock
c) Amount of time a deadlocked process has thus far consumed during its execution
View Answer
Answer: c
Explanation: None.
6. If we preempt a resource from a process, the process cannot continue with its
normal execution and it must be ____________
a) aborted
b) rolled back
c) terminated
d) queued
View Answer
Answer: b
Explanation: None.
7. To _______ to a safe state, the system needs to keep more information about the
states of processes.
a) abort the process
b) roll back the process
c) queue the process
View Answer
Answer: b
Explanation: None.
8. If the resources are always preempted from the same process __________ can occur.
a) deadlock
b) system crash
c) aging
d) starvation
View Answer
Answer: d
Explanation: None.
9. What is the solution to starvation?

a) the number of rollbacks must be included in the cost factor
b) the number of resources must be included in resource preemption
c) resource preemption be done instead
View Answer
Answer: a
*Deadlock Handling Strategies in Distributed system
1. A system is in a _______ state if there exists a set of transactions in which every

transaction is waiting for another transaction in the set.
a) Deadlock
b) Starved
c) Isolated
d) None of the mentioned
View Answer
Answer: a
2. Which of the following is not a method in deadlock handling

a) Deadlock prevention
b) Deadlock detection
c) Deadlock recovery
d) Deadlock distribution
View Answer
Answer: d
3. Deadlocks can be prevented using

a) Preemption and transaction rollbacks
b) Wait and die scheme
c) Wound-wait scheme
View Answer
Answer: d
4. State true or false: Wait die scheme is a non-preemptive technique

a) True
b) False
View Answer
Answer: a
5. Lock timeouts have which of the following advantages?

a) Unnecessary rollbacks do not occur
b) Transactions do not starve
c) It is easy to implement
View Answer
Answer: d
6. The _________ graph describes deadlocks precisely

a) Wound wait graph
b) Wait die graph
c) Wait for graph
View Answer
Answer: c
7. How do we generally recover from a deadlock?

a) By aborting all the transactions
b) By rolling back all the transactions
c) By rolling back only a selected number of transactions
View Answer
Answer: c
8. State true or false: Partial rollback is not possible.

a) True
b) False
View Answer
Answer: b
9. Which of the following steps must be taken while choosing a victim?

a) Avoiding starvation
b) Number of transactions involved in rollback
c) Data items used by the transaction
View Answer
Answer: d
*Centralized and distributed deadlock detection algorithm

Introduction

Uploaded by

Copyright:

Available Formats

Introduction

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Introduction

Uploaded by

Copyright:

Available Formats

UNIT 3 : Distriuted Deadlock Detection

1. What is a reusable resource?

2. Which of the following condition is required for a deadlock to be possible?

3. A system is in the safe state if ____________

4. The circular wait condition can be prevented by ____________

5. Which one of the following is the deadlock avoidance algorithm?

6. What is the drawback of banker’s algorithm?

7. For an effective operating system, when to check for deadlock?

8. A problem encountered in multitasking when a process is perpetually denied

10. To avoid deadlock ____________

3. Those processes should be aborted on occurrence of a deadlock, the termination of

4. The process to be aborted is chosen on the basis of the following factors?

5. Cost factors for process termination include ____________

9. What is the solution to starvation?

*Deadlock Handling Strategies in Distributed system

1. A system is in a _______ state if there exists a set of transactions in which every

2. Which of the following is not a method in deadlock handling

3. Deadlocks can be prevented using

4. State true or false: Wait die scheme is a non-preemptive technique

5. Lock timeouts have which of the following advantages?

6. The _________ graph describes deadlocks precisely

7. How do we generally recover from a deadlock?

8. State true or false: Partial rollback is not possible.

9. Which of the following steps must be taken while choosing a victim?

*Centralized and distributed deadlock detection algorithm

You might also like