HamiIT
Sign inGet started
Home
Theme
ADD CONTENT

Sign in Required

Please sign in to add content

Sign In
ProgramsBsc CSITSemester 4Operating SystemUnit 3: Process Deadlocks (6 Hrs.)
Chapter Study

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

Comprehensive questions and detailed answers for Unit 3: Process Deadlocks (6 Hrs.). Perfect for exam preparation and concept clarity.

11
Questions
75
Marks
Back to All Chapters
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 disk space for print spool is limited?
How may the deadlock be avoided?

MediumTHEORY5 marks2070(TU Final)
2

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

MediumTHEORY5 marks2071(TU Final)
3

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

MediumTHEORY10 marks2072(TU Final)
4

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

MediumTHEORY5 marks2072(TU Final)
5

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

MediumTHEORY5 marks2076(TU Final)
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.

ProcessHasMax
A26
B15
C23
D38

Free = 2

  • What will happen if process D request 1 resource?\
  • What will happen if process A request 1 resource?
HardTHEORY10 marks2078(TU Final)
7

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

MediumTHEORY5 marks2078(TU Final)
8

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

HardTHEORY10 marks2080(TU Final)
9

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

MediumTHEORY5 marks2080(TU Final)
10

How do you think deadlock can be avoided? Explain.

MediumTHEORY5 marks2081(TU Final)
11

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

HardTHEORY10 marks2080(TU Final)
Showing 11 questions

Sample Questions

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: 5Chapter: Unit 3: Process Deadlocks (6 Hrs.)

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

Marks: 5Chapter: Unit 3: Process Deadlocks (6 Hrs.)

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

Marks: 10Chapter: Unit 3: Process Deadlocks (6 Hrs.)

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

Marks: 5Chapter: Unit 3: Process Deadlocks (6 Hrs.)

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

Marks: 5Chapter: Unit 3: Process Deadlocks (6 Hrs.)

And more questions available on this page.

About Unit 3: Process Deadlocks (6 Hrs.) Questions

This page contains comprehensive questions from the Unit 3: Process Deadlocks (6 Hrs.) chapter of Operating System, part of the Bsc CSIT Semester 4 curriculum. All questions include detailed model answers from past TU exam papers.

Study Tips

  • Review concepts before attempting questions
  • Practice writing complete answers
  • Compare your answers with model solutions
  • Focus on questions from recent years
  • Use direct links (#question-ID) to bookmark and share specific questions

Related Resources

← Back to Operating System Chapters

Unit 3: Process Deadlocks (6 Hrs.) chapter questions with answers for Operating System (Bsc CSIT Semester 4). Prepare for TU exams with our comprehensive question bank and model answers.

H
Hami IT

Empowering IT students with quality education resources and comprehensive exam preparation materials.

Programs

  • Flutter
  • Java
  • DevOps

Company

  • About Us
  • Contact
  • Terms of Service
  • Privacy Policy

Contact

  • 📧contact@hamiit.com
  • 📞+977 9813706443
  • 📍Kathmandu, Nepal

Community

  • Join Discord
  • Report a bug
  • Request feature

© 2026 Hami IT. All rights reserved.