Operating Systems CS604 assignment 2 download file

 DOWNLOAD FILE LINK

 

Operating Systems (CS604)

Assignment # 02

Spring 2024

 

Total marks = 20                                                                              

Deadline

June 24, 2024

 

Please carefully read the following instructions before attempting the 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 the file is corrupted.
  • Strict action will be taken if the submitted solution is copied from any other student or the internet.

 

You should consult the recommended books to clarify your concepts, as handouts are insufficient.

You are supposed to submit your assignment in Doc or Docx format.

Any other formats like scanned images, PDF, ZIP, RAR, PPT, BMP, etc. will not be accepted.

 

Topic Covered:

·       Banker’s Algorithm/Safety Algorithm

·       Resource Allocation

·       Deadlock Avoiding

 

Topic Covered

Lecture 12 to Lecture 31

 

 

 

NOTE

 

No assignment will be accepted via email after the due date (whether it is load shedding, internet malfunctioning, etc.). Hence, refrain from uploading assignments within the last hour of the deadline. It is recommended that the solution be uploaded at least two days before its closing date.

 

If you find any mistakes or confusion in the assignment (Question statement), please consult your instructor before the deadline. After the deadline, no queries will be entertained in this regard.

 

For any query, feel free to email me at:

cs604@vu.edu.pk

 

Question Statement                                                                                                                      20 marks

Consider a system with three processes (P0, P1, P2) and three resource types (A, B, C). The system is described by the following data:

 

Total Resources:

A

B

C

7

2

3

 

Allocation Matrix

 

A

B

C

P0

0

1

0

P1

2

0

1

P2

3

0

2

 

Maximum Demand (Max) Matrix:

 

A

B

C

P0

6

1

2

P1

3

1

2

P2

5

0

2

 

Solve the below parts using Banker’s Algorithm (Safety Algorithm).

Part 1:

1.     Calculate the initial available resources.

1.  Calculate the Need matrix.


Part 2:

       Determine if the current system state is safe or not?

·       If it is safe, provide the unique safe sequence.

·       If it is not, then justify your answer.




Comments

Post a Comment

Popular posts from this blog

CS202 assignment 2 solution file download

Image
    DOWNLOAD FILE LINK Assignment No. 02 Semester: Spring 2024 CS202: Fundamentals of Front-End Development Total Marks: 20 Week (6-11) Topics: (61 to 138) Due Date: June-24-2024     Instructions:   Please read the following instructions carefully before submitting an assignment. It should be clear that your assignment will not get any credit if:   ▪         The assignment is submitted after the due date. ▪         The submitted assignment does not open or the file is corrupt. ▪         Assignment is copied (partial or full) from any source (websites, forums, students, etc.)   Note: 1) You have to just upload a . doc and .docx file which will have the code of HTML and JavaScript and Screenshot of the Output . Assignment in any other format (extension) will not be accepted and will be a
Read more

cs606 Assignment 2 2024 download file

Image
         DOWNLOAD FILE     SOLUTION  Goto (I0, A): [S → A . B C D E, #] Goto (I0, A): [B → .C D E, a/b] Goto (I0, A): [C → .D E, a/b] Goto (I0, A): [D → .E, a/b] Goto (I0, A): [E → .a, a/b] Goto (I0, A): [E → .b, a/b] Goto (I0, B): [A → B . C D E, a/b] Goto (I0, B): [S → A B . C D E, #] Goto (I0, B): [C → .D E, a/b] Goto (I0, B): [D → .E, a/b] Goto (I0, B): [E → .a, a/b] Goto (I0, B): [E → .b, a/b] Goto (I0, C): [B → C . D E, a/b] Goto (I0, C): [A → B C . D E, a/b] Goto (I0, C): [S → A B C . D E, #] Goto (I0, C): [D → .E, a/b] Goto (I0, D): [C → D . E, a/b] Goto (I0, D): [B → C D . E, a/b] Goto (I0, D): [A → B C D . E, a/b] Goto (I0, E): [D → E . , a/b] Goto (I0, a): [E → a ., a/b] Goto (I0, b): [E → b ., a/b]
Read more