Bsc CSIT Semester 4 – Operating System – Unit 3: Process Deadlocks (6 Hrs.)

Question 1

Students working at individual PCs in a computer laboratory send their files to be printed by a server which spools the files on its hard disk. Under what conditions may a deadlock occur if the d

Marks: 5

Year: 2070 Final TU

- Scenario: Many users submit print jobs; server spools to disk. If each job needs S blocks and total free < sum of partially allocated jobs, each job may hold some blocks and wait for more → circular

Question 2

What do you understand by deadlock detection and recovery? Discuss.

Marks: 5

Year: 2071 Final TU

Deadlock Detection and Recovery 1. Deadlock - Definition: Deadlock is a situation in which two or more processes are waiting indefinitely for resources held by each other, and none can proceed. - E

Question 3

What is deadlock? Explain various conditions for deadlock. Discuss the Bankers algorithm of multiple resources for avoidance of deadlock with suitable example.

Marks: 10

Year: 2072 Final TU

Deadlock, Conditions & Banker's Algorithm (10 Marks) 1. What is Deadlock? A deadlock is a situation in an operating system where two or more processes are blocked forever, waiting for resources that

Question 4

What is deadlock? State the conditions necessary for deadlock to exist. Give reason, why all conditions are necessary.

Marks: 5

Year: 2072 Final TU

Deadlock in Operating System Definition: A deadlock is a situation in an operating system where two or more processes are unable to proceed because each is waiting for a resource that is held by anoth

Question 5

Differentiate between deadlock and starvation? Discuss the process of detecting deadlocks when there are multiple resources of each type.

Marks: 5

Year: 2076 Final TU

Difference between Deadlock and Starvation | Deadlock | Starvation | |---------------|----------------| | Occurs when two or more processes are permanently blocked and waiting for resources held by ea

Question 6

How unsafe state differs from deadlocked state? Consider follows initial state and identify wheather requested is and granted or denies for the given cases. Process | Has | Max| ----|-----|-----| A |2

Marks: 10

Year: 2078 Final TU

Unsafe State vs Deadlocked State - Deadlocked State: - No process can proceed because each is waiting indefinitely for resources held by others. - System is completely stuck. - Unsafe State:

Question 7

What is resource allocation graph? Explain the process of detecting deadlocks when there is single instance of each resources with suitable example?

Marks: 5

Year: 2078 Final TU

Resource Allocation Graph (RAG) 1. Definition: - A Resource Allocation Graph is a directed graph used to represent the allocation of resources to processes in a system. - Helps in deadlock detection

Question 8

How do you distinguish between deadlock and starvation ? Describe and Explain working mechanism of TLB.

Marks: 10

Year: 2080 Final TU

1. Difference Between Deadlock and Starvation | Feature | Deadlock | Starvation | |---------|----------|------------| | Definition | A state in which two or more processes are waiting indefinitely for

Question 9

Illustrate the term safe and unsafe state in deadlock prevention with scenario.

Marks: 5

Year: 2080 Final TU

Safe and Unsafe States in Deadlock Prevention 1. Definitions - Safe State: A system is in a safe state if there exists a sequence of process execution such that all processes can finish without c

Question 10

How do you think deadlock can be avoided? Explain.

Marks: 5

Year: 2081 Final TU

Deadlock Avoidance Deadlock is a situation where a set of processes are permanently blocked because each process is waiting for a resource held by another. To avoid deadlock, the operating system ens

Question 11

Can deadlock occur in case of preemptive resources? List the conditions for deadlock. Define allocation graph with example.

Marks: 10

Year: 2080 Final TU

1. Deadlock with Preemptive Resources Definition of Deadlock: - Deadlock is a situation in which two or more processes are waiting indefinitely for resources held by each other, and none can proceed