CS-418 Homework 3 - Apply the Banker's Algorithm to...

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

View Full Document Right Arrow Icon
Professor: Van Horn CS-418 Homework 3 1. What are the four requirements for deadlock? 2. Explain why the graph on Slide 11 in the Chapter PowerPoint file represents a deadlock.
Background image of page 1

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

View Full DocumentRight Arrow Icon
3. Explain why the graph on Slide 12 is not a deadlock even though there is a cycle.
Background image of page 2
4. Given a system with 4 resource types, A, B, C, and D with 3 processes and these allocations, maximum claims, and number of available resources.
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Apply the Banker's Algorithm to determine if the system is in a safe state. If not, specify why. If so, give the safe execution sequence of processes. (Show your work.) Allocation Max Need Process A B C D A B C D A B C D P1 2 1 1 3 2 1 4 2 3 P2 1 2 1 2 4 2 1 2 1 P3 4 3 4 1 6 1 3 Available A B C D 2 2 2...
View Full Document

Page1 / 3

CS-418 Homework 3 - Apply the Banker's Algorithm to...

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