Banker''s algorithm, Operating System

Consider the following snapshot of a system, answer the following questions using the banker's algorithm:

1. What is the content of the matrix Need? Is the system in a safe state?

2. If a request from Process P1 arrives for (0,4,2,0), can the request be granted immediately?

(Please show the intermediate steps besides final answer)

Process

Allocation

ABCD

Max

ABCD

Available

ABCD

P0

0 0 1 2

0 0 1 2

1 5 2 0

P1

1 0 0 0

1 7 5 0

 

P2

1 3 5 4

2 3 5 6

 

P3

0 6 3 2

0 6 5 2

 

P4

0 0 1 4

0 6 5 6

 

Posted Date: 4/2/2013 4:05:24 AM | Location : United States







Related Discussions:- Banker''s algorithm, Assignment Help, Ask Question on Banker''s algorithm, Get Answer, Expert's Help, Banker''s algorithm Discussions

Write discussion on Banker''s algorithm
Your posts are moderated
Related Questions
how to move the system app to usb storage

Declare some Applications of Open Source Systems • Finance • Educational • Data Storage and Management • ERP (Enterprise Resource Planning) •File Sharing & FTP

Define deadlock prevention. Deadlock prevention is a set of process for ensuring that at least one of the four essential conditions like mutual exclusion, hold and wait, no pr

Write a short note on file organization and access. There are three methods to access files 1Record Access 2Sequential Access 3Random Access The record access

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

difference between soft link and hard links

Q. Operating System as User Interface? • Every general purpose computer comprises the operating system, hardware, system programs and application programs. The hardware compris

Q. What kinds of services does the process manager provide? Define local procedure call? Answer: The process manager offers services for creating and deleting and using proce

Sharing segments between processes without requiring the same segment number is possible in a dynamically linked segmentation system. a. Define a system that permits sta