Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

Assignment No. 03 Semester: Fall 2014 CS604 –Operating System Total Marks: 15 Due Date: 16/2/2015

Uploading instructions:

 

  • Your assignment must be in .doc format. (Any other formats like scan images, PDF, Zip, rar, bmp,etc will not be accepted).
  • Save your assignment with your ID (e.g. bc020200786.doc).
  • No assignment will be accepted through email.

 

Rules for Marking:

 

It should be clear that your assignment will not get any credit if:

  • The assignment is submitted after due date.
  • The submitted assignment does not open or file is corrupted.
  • Your assignment is copied from internet, handouts or from any other student

      (Strict disciplinary action will be taken in this case).

 

Assignment

 

Question 1:   (5 Marks)

 

Consider the following snapshot of a system:

 

 

Allocation

Max

Available

 

A

B

C

D

A

B

C

D

A

B

C

D

P0

1

1

1

2

3

4

2

2

1

2

3

4

P1

1

0

2

2

1

3

4

14

 

 

 

 

P2

1

4

5

6

2

7

5

8

 

 

 

 

P3

2

5

4

2

3

5

7

9

 

 

 

 

P4

1

5

2

7

1

6

3

9

 

 

 

 

 

Need

A

B

C

D

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Answer the following questions using the banker’s algorithm:

 

(a)   What is the content of the matrix Need?                                             5

 

 

(b)   Is the system in a safe state? If yes identify the safe sequence. Show the step by step execution by updating the data structure if necessary.                                                            10

 

 

NOTE:Do not put any query on MDB about this assignment, if you have any query then emailatcs604@vu.edu.pk.

 

Deadline: Your assignment must be uploaded/submitted on or before

Views: 7403

Attachments:

Replies to This Discussion

Permalink Reply by saleem Kalro on February 17, 2015 at 10:53am

safe sequence is <P4, P0, P1, P2, P3>

this is correct answer

but i can be achieved in 3 or four steps

Permalink Reply by sadima on February 17, 2015 at 11:58am

This is the corrected solution plz change it before submit and pray for me.

Attachments:
Permalink Reply by nazish noor on February 17, 2015 at 1:34pm

thnk  u 

Permalink Reply by Maham Ali on February 17, 2015 at 2:45pm

Thanks ......

Permalink Reply by lll.NaYaB.lll(Mcs) on February 17, 2015 at 2:54pm

thanxxxxxx

Permalink Reply by shagufta parveen on February 17, 2015 at 5:45pm

thanx GODbless u

Permalink Reply by NADEEM Ch on February 17, 2015 at 7:17pm

thanks

Permalink Reply by zunaira malik on February 17, 2015 at 7:26pm

thanku

Permalink Reply by syed qaisar javaid on February 17, 2015 at 8:24pm

My Solution:

Need

A

B

C

D

2

3

1

0

0

3

2

12

1

3

0

2

1

0

3

7

0

1

1

2
Permalink Reply by syed qaisar javaid on February 17, 2015 at 8:43pm

 

Need

Allocation

Available

Process

A

B

C

D

A

B

C

D

A

B

C

D

P0

2

3

1

0

1

1

1

2

1

2

3

4

P1

0

3

2

12

1

0

2

2

2

7

5

11

P2

1

3

0

2

1

4

5

6

3

8

6

13

P3

1

0

3

7

2

5

4

2

4

8

8

15

P4

0

1

1

2

1

5

2

7

5

12

13

21
Permalink Reply by syed qaisar javaid on February 17, 2015 at 8:43pm

Enjoy dear students: Best of luck

Permalink Reply by syed qaisar javaid on February 17, 2015 at 8:46pm

Safe sequence

 < P4, P0, P1, P2, P3 >

RSS

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service