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

 

 

[Shinning star]

yh part b correct hy?ar part a ka graph bnana hy?plz help kr dn

[Iqra Hadayat]

dear m n bi ese hi bnae but m soch ri k sir n P1 to P5 bola to jb P! or P4 remaining rehte to hm pehle P1 ko solve kr len then P4 ko?

[+ M.Tariq Malik]

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

 

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

[1ytm8h8n3nn58]

**********

[+ M.Tariq Malik]

[Amal Hanif]

Check this..if we add instances in P2.

[Fawad]

kisi aik solution py agree huwe han sab to wo send karen plzz