CS604 Assignment 3 Solution and Discussion

[zaasmi]

Re: CS604 Assignment 3 Solution and Discussion

Operating Systems(CS604)
Assignment # 03
Spring 2020
Total marks = 15

Deadline Date
27th July 2020

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.

Objective:
• The objective of this assignment is to learn deadlock avoidance algorithm.
• The objective of this assignment is to learn page addressing.

NOTE

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:
[email protected]

Question No 01 15 marks
Consider the below given table showing the system state at a certain time. There are five processes P0 to P4 and four types of resources A, B, C and D. The resource allocation, max and available matrices for each process are also given in the table as shown below.

           Allocation 			    Max 		         Available
A 	B 	C 	D	A 	B 	C 	D 	A 	B      C      D
P0 	0 	0 	1 	2 	0 	0 	1 	2 	1 	5       2       0
P1 	1 	0 	0 	0 	1 	7 	5 	0
P2 	1 	3 	5 	4 	2 	3 	5 	6
P3 	0 	6 	3 	2 	0 	6 	5 	2
P4 	0 	0 	1 	4 	0 	6 	5 	6

Considering the Banker’s algorithm for deadlock avoidance, answer the following questions.

(a) Compute and show the Need matrix for processes in the system.
(b) Is the system in safe state? If YES, then show the safe sequence. If NOT in safe state, then explain the reason.

Wish you very best of luck!

[Ch. Robika]

idea solution plz