We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

Assignment No. 03

Semester: Spring 2018

Operating Systems (CS604)

 

Total Marks: 20

 

Due Date:  23/7/2018

 

Instructions:                          

Please read the following instructions carefully before submitting assignment:

§  You should submit your assignment before or on due date on VULMS.

§  Your assignment should be your own work in your own words. It should not be copied from Internet, handouts or books.

§  Your Assignment must be in Microsoft Word document. Assignment in other than Microsoft Word document will not be accepted.

§  Assignment sent via Email will not be replied and accepted.

§  If the submitted assignment does not open or file is corrupt, it will not be marked and hence awarded zero marks.

Objectives:

·         To understand the working of Deadlock detection algorithm.

 

 

For any query about the assignment, contact at CS604@vu.edu.pk

 

Question                                                                                                                                    Marks 20    

 

a. Consider a system with five processes: P1, P2, P3, P4, P5 and five resource types: R1, R2, R3, R4, R5 with single instance. From the given below information, you are required to determine whether the deadlock exists in the system though deadlock detection strategy for resources with single instance.

 

P = {P1, P2, P3, P4, P5}

R = {R1, R2, R3, R4, R5}

E = {P1®R1, R1®P2, P2®R2, R2®P3, P3®R3, R3®P4, P4®R4, R4®P5, P5®R5, R5®P1}

 

b. Consider a system with five processes: P1, P2, P3, P4, P5 and four resource types: R1, R2, R3 and R4 with multiple instances. From the given below information, you are required to determine whether the deadlock occurs in a system though deadlock detection strategy for resources with multiple instances.

 

P = {P1, P2, P3, P4, P5}

R = {R1, R2, R3, R4}

 

R1: 5 instances

R2: 3 instances

R3: 2 instances

R4: 4 instances

 

 

 

 

 

 

Consider the system in following state:

 

 

Processes

Allocation

Request

Work

R1

R2

R3

R4

R1

R2

R3

R4

R1

R2

R3

R4

P1

0

0

0

0

0

1

0

0

0

0

1

1

P2

0

1

0

1

0

0

1

1

 

 

 

 

P3

2

0

0

2

0

0

1

1

 

 

 

 

P4

1

1

0

0

2

1

2

0

 

 

 

 

P5

2

1

1

0

1

0

0

1

 

 

 

 

 

 

 

Note: There can be many sequences so you are required to start from top to bottom for “Processes” column. i.e. P1 to P5.

 

BEST OF LUCK

 

 


+ Click Here To Join also Our facebook study Group.


+ Prohibited Content On Site + Report a violation + Report an Issue


..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 9630

.

+ http://bit.ly/vucodes (Vu Study Groups By Subject Codes Wise)

Attachments:

Replies to This Discussion

Share Your Ideas ...

Sample Solution for Part B OS-Sample.png

plz share the idea or correct answer

Dead Lock Exist on Part B or Not?

1st question main Resources 4 hn (R = {R1, R2, R3, R4}) but neachy 5 hn

E = {P1®R1, R1®P2, P2®R2, R2®P3, P3®R3, R3®P4, P4®R4, R4®P5, P5®R5, R5®P1}           koi samjha sakta hy

It is for single instance , not for multiple.

to part a mai b single instance hi required hy na..

Lekin ap na jo Drawing symbols use kiya ha wo multiple instance k hain

it is correct and cyclic so there is deadlock exist.

Resources waly Vertices main sy dot remove kr do ya sirf 1 dot rehny do,baqi Graph theek hai..

is it necessary to start with P1 in part B?

RSS

Latest Activity

Study Corner For DigiSkills Students

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

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