CS604 Assignment # 03 Solution and Discussion
Operating Systems (CS604)
Assignment # 03 Spring 2019
Total marks = 20
Deadline Date 23rd July, 2019
Please carefully read the following instructions before attempting assignment.
RULES FOR MARKING
It should be clear that your assignment would not get any credit if:
♣ The assignment is submitted after the due date.
♣ The submitted assignment does not open or file is corrupt.
♣ Strict action will be taken if submitted solution is copied from any other student or from the internet.
You should consult the recommended books to clarify your concepts as handouts are not sufficient.
You are supposed to submit your assignment in .doc or docx format.
Any other formats like scan images, PDF, zip, rar, ppt and bmp etc will not be accepted.
• The objective of this assignment is to provide hands on experience of:
• To learn and understand deadlock algorithms in Operating System
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.
If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline no queries will be entertained in this regard.
For any query, feel free to email at:
Question No 1 15 Marks
Consider the below given snapshot of the system. P1 to P5 represent the 5 processes currently running on the system. M, N, O and P represent the resources whereas M, N, O and P have 13, 11, 9 and 16 instances respectively.
Considering the given snapshot, answer the following questions using the banker’s algorithm:
(a) What will be the content of the matrix Available? 5 Marks
(b) What will be the content of the matrix Need? 5 Marks
© Is the system in a safe state Yes/No? If yes, then identify the safe sequence. 5 Marks
Question No 2 5 Marks
Consider the following resource allocation graph. Is there any deadlock in this graph or not? If yes, then mention the dead lock sequence.