mid2 - CS 470 - Exam 2 November 18, 2005 Maximum points 100...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS 470 - Exam 2 November 18, 2005 Maximum points 100 Note: Answer all questions. Your answers should be precise to the point. Show your work to get partial credit for problems involving computation. In true/false questions true means always true , false means sometimes true or never true 1. (Deadlocks) (a) Consider a system with four processes P 1 ,P 2 ,P 3 ,P 4 and three resource types A,B,C . Suppose the following snapshot of the system is taken at time T : Allocation Max Available ========== === ========= A B C A B C A B C P1 5 3 6 5 5 7 2 2 4 P2 1 2 6 3 3 P3 2 3 2 3 3 2 P4 3 2 1 7 5 3 Is this state a safe state? Justify your answer. At this state, if P 2 makes a request for 2 units of A and 2 units of B and 0 units of C , can the request be granted without taking the system to an unsafe state? Justify your answer . (15 points) (b) (Deadlocks) i. State whether each of the following statements is true or false. Justify your answer ....
View Full Document

This document was uploaded on 12/14/2010.

Page1 / 8

mid2 - CS 470 - Exam 2 November 18, 2005 Maximum points 100...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online