Assignment No 3 CS-604

[Aniya Khan]

	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 [e-mail]
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

 

 

[Aniya Khan]

Share Your Ideas ...

[VU-Helps]

Sample Solution for Part B OS-Sample.png

[Haider Bhatti]

plz share the idea or correct answer

[Abdul Fahad]

Dead Lock Exist on Part B or Not?

[Muhammad Waqas]

1st question main Resources 4 hn (R = {R₁, R₂, R₃, R₄}) but neachy 5 hn

E = {P₁®R₁, R₁®P₂, P₂®R₂, R₂®P₃, P₃®R₃, R₃®P₄, P₄®R₄, R₄®P₅, P₅®R₅, R₅®P₁}           koi samjha sakta hy

[Aniya Khan]

Is this correct answer or not ?

[VU-Helps]

It is for single instance , not for multiple.

[Aniya Khan]

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

[Abdul Fahad]

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

[Dildar Hussain]

it is correct and cyclic so there is deadlock exist.

[M Ilyas | (Ex-VU)]

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

[Mona]

is it necessary to start with P1 in part B?