Chapter Study

BSC CSIT Semester 4 Operating System () Questions & Answers | Past TU Exam Papers

Practice from Operating System with detailed solutions and model answers from past Tribhuvan University exams.

11
Questions
75
Marks
Back to All Chapters

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)

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

MediumTHEORY5 marks2071(TU Final)

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)

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

MediumTHEORY5 marks2072(TU Final)

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

MediumTHEORY5 marks2076(TU Final)

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)

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)

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

HardTHEORY10 marks2080(TU Final)

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

MediumTHEORY5 marks2080(TU Final)

How do you think deadlock can be avoided? Explain.

MediumTHEORY5 marks2081(TU Final)

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

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.