Scribd
Upload
17 views

Deadlock and Starvation - Part 1

Uploaded by

www.omarehab3710
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

Deadlock and Starvation - Part 1

Uploaded by

www.omarehab3710
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Deadlock and Starvation

1. A ……………… is one that can be safely used by only one process at a time and is not depleted by that use.
A) Reusable Resource B) Single Process Resource C) Consumable Resource D) Produced Resource

2. Processors, I/O channels, main and secondary memory devices, and data structures such as files, databases, and
semaphores are the examples of …….
A) Reusable Resource B) Single Process Resource C) Consumable Resource D) Produced Resource

3. ……………………. is one that can be created and destroyed.


A) Reusable Resource B) Single Process Resource C) Consumable Resource D) Produced Resource

4. Interrupts, signals, messages, and information in I/O buffers are the examples of ……………….
A) Reusable Resource B) Single Process Resource C) Consumable Resource D) Produced Resource

5. Which of the following are the conditions of policy must be present for a deadlock to be possible.

i) If only one process may use a resource at a time

ii) If a process may hold allocated resources while awaiting assignment of others

iii) If no resource can be forcibly removed from a process holding it.


A) i and ii only B) ii and iii only C) i and iii only D) All i, ii and iii

6. ………………. is needed to ensure consistency of results and integrity of a database.


A) Mutual Exclusion B) Hold and Wait C) Preemption D) Circular Wait

7. …………………… cannot be done arbitrary and especially when data resources are involved, must be supported
by a rollback recovery mechanism.
A) Mutual Exclusion B) Hold and Wait C) Preemption D) Circular Wait

8. ………………. is a closed chain of processes existing, such that each process holds at least one resource needed
by the next process in the chain.
A) Mutual Exclusion B) Hold and Wait C) Preemption D) Circular Wait

9. Which of the following is/are the schemes used for the prevention of deadlock.

i) Requesting all resources ii) Preemption iii) Resource Ordering iv) Manipulate to find at least one safe path
A) i, ii and iii only B) ii, iii and iv only C) i, iii and iv only D) All i, ii, iii and iv

10. Invoking periodically to test for deadlock is one of the ways for deadlock ……………….
A) Prevention B) Avoidance C) Detection D) Deletion

11. Which of the following is/are the major advantages of requesting all resources at once.

i) Works well for processes that perform a single burst of activity

ii) No preemption is necessary iii) Feasible to enforce via compile-time checks


A) i and ii only B) ii and iii only C) i and iii only D) All i, ii and iii
12. The indirect method of …………………. is to prevent the occurrence of one of the three necessary conditions:
Mutual exclusion, Hold and Wait and No preemption.
A) deadlock prevention B) deadlock avoidance C) deadlock detection D) deadlock deletion

13. A direct method of deadlock prevention is to prevent the occurrence of a ………………….


A) Mutual Exclusion B) Hold and Wait C) Preemption D) Circular Wait

14. The condition can be prevented by requiring that a process request all its required resources at once time and
blocking the process until all requests can be granted simultaneously.
A) Mutual Exclusion B) Hold and Wait C) Preemption D) Circular Wait

15. The …………………. condition can be prevented by defining a linear ordering of resource types.
A) Mutual Exclusion B) Hold and Wait C) Preemption D) Circular Wait

16. With …………………. a decision is made dynamically whether the current resource allocation request will, if
granted potentially lead to deadlock.
A) deadlock prevention B) deadlock avoidance C) deadlock detection D) deadlock deletion

17. To ………………. the deadlock does not grant an incremental resource request to a process if this allocation
might lead to deadlock.
A) Prevent B) Avoid C) Detect D) Delete

18. In resource allocation denial, a ………………………. is one in which there is at least one sequence that does not
result in a deadlock.
A) Safe state B) Unsafe state C) Safe allocation D) Unsafe allocation

19. Which of the following is/are the restrictions on deadlock avoidance.

i) The maximum resource requirement for each process must be stated in advance

ii) There must be a fixed number of resources to allocate

iii) No process may exit while holding resources.


A) i and ii only B) ii and iii only C) i and iii only D) All i, ii and iii

20. In ……………………. The processes under consideration must be independent: that is, the order in which they
execute must be unconstrained by any synchronization requirements.
A) deadlock prevention B) deadlock avoidance C) deadlock detection D) deadlock deletion

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy