V Semester B.
Tech Assignment-II
Computer Science and Engineering
(Artificial Intelligence & Machine Learning)
Course Title: Operating Systems
Course Code: 22AM3502
Answer all the Questions
Total Marks: 10
Dead line: 12.12.2024
1. Explain Circular-wait for the occurrence of deadlock and how it could be prevented. Consider a
system consisting of m resources of the same type being shared by n processes only one at a time.
Show that the system is deadlock free if the following condition holds:
(a) The maximum need of each process is between 1 and m resources.
(b) The sum of all maximum needs is less than m + n.
2. "All unsafe states may not lead to deadlock." - Why or why not? What is Bankar's safety algorithm?
3. Consider the following snapshot of a system, analyze the following questions using the deadlock
detection algorithm:
• Is the system in a deadlock state?
• Suppose that P2 makes one additional request for an instance of type C.
• If this request is granted then check deadlock occur or not.
Process Allocation Max Available
A B C A B C A B C
P0 0 1 0 0 1 0 0 0 0
P1 2 0 0 2 0 2
P2 3 0 3 0 0 0
P3 2 1 1 1 0 0
P4 0 0 2 0 0 2
Instruction:
1. Write all the assignments using plain A4 page by hand, after that scan and save as a PDF
document. Finally UPLOAD it in ERP.
Signature
Prof. Subhash Mondal
Course-Coordinator
