Question about Microsoft Windows XP Professional

1 Answer

C program for banking algorithm to find deadlock.

Simple c program for bankers algorithm to find deadlock.

Posted by on

Ad

1 Answer

  • Level 3:

    An expert who has achieved level 3 by getting 1000 points

    All-Star:

    An expert that got 10 achievements.

    MVP:

    An expert that got 5 achievements.

    Brigadier General:

    An expert that has over 10,000 points.

  • Master
  • 10,406 Answers

Nice try. Find an upper-class student to give you one-on-one tutoring with your homework.

Posted on Dec 02, 2009

Ad

1 Suggested Answer

6ya6ya
  • 2 Answers

SOURCE: I have freestanding Series 8 dishwasher. Lately during the filling cycle water hammer is occurring. How can this be resolved

Hi,
a 6ya expert can help you resolve that issue over the phone in a minute or two.
best thing about this new service is that you are never placed on hold and get to talk to real repairmen in the US.
the service is completely free and covers almost anything you can think of (from cars to computers, handyman, and even drones).
click here to download the app (for users in the US for now) and get all the help you need.
goodluck!

Posted on Jan 02, 2017

Ad

Add Your Answer

Uploading: 0%

my-video-file.mp4

Complete. Click "Add" to insert your video. Add

×

Loading...
Loading...

Related Questions:

2 Answers

When i applyfor online banking i didnt get the activation code my phone broke before i got it is there a way i can get it without going into the bank?


You can request the Activation Code again to your new phone. If that is not possible, you can do it over the phone. Third choice, go into the branch.

Jul 29, 2017 | The Computers & Internet

1 Answer

Why is the bank taking out money from my bank accout


Look at you bank statement for an explanation of fees and charges...or call you banker that the account is affiliated with for the explanation.

Feb 20, 2017 | The Computers & Internet

1 Answer

What if i dnt havea bankstatement


were not bankers or a bank ---a bank statement is a list or informational account of your banking history and that would only show what accounts and what you do and have done with your money in those accounts --if you go into a bank to withdraw money or transfer you need an account number and proper id

Jul 13, 2016 | Computers & Internet

1 Answer

As an aged bpensioner can I lend money to a relative


you can provided you can prove that it is a loan - legal agreement-( otherwise gift tax becomes a problem)
Remember this when you lend money you become a banker and you relative becomes a client and many a client fails to repay the banker which creates bad blood in the family
If a relative wants money send them to a bank and you can go as a guarantor for the loan. That way they have to repay the bank or get a bad credit rating and you can cut your losses by paying the bank out.

Mar 23, 2015 | Computers & Internet

1 Answer

Unable to transfer funds in credit to me from my paypal account to my bank account


you have to have on line banking set up with the bank that you wish to transfer funds from.That means that you have to go in the bank and sit down with a banker and log on

Mar 03, 2013 | Computers & Internet

1 Answer

What are the official rules concerning the banker for the board game Monopoly


Besides the Bank's money, the Bank holds the Title Deeds, and the houses and hotels prior to purchase by the players. The Bank pays salaries and bonuses. It sells and auctions properties and hands out the proper Title Deed cards when purchased by a player, it also sells houses and hotels to the players and loans money when required on mortgages.
The Bank collects all taxes, fines, loans and interest, and the price of all properties which it sells and auctions. The Bank "never goes broke." If the Bank runs out of money, the Banker may issue as much as needed by writing on any ordinary paper.

That should be all you need to know about the "banker". Now as everyone knows there are many variations called "house" rules as long as they are agreed upon by all players before the game.
Thank you,
lee

Oct 06, 2010 | Monopoly Games

1 Answer

Sir I forgot ATM code in your bank account


If it is your code for your bank account the you go your bank to rectify your problem with your banker.

Sorry my bank code is P & C.

Aug 26, 2010 | Computers & Internet

1 Answer

I have a trial version of excel 7 on my computer; it has expired what doI need to buy to enable wha have?


process allocation Max
A B C D A B C D
p1 0 0 1 2 0 0 1 2
p2 2 0 0 0 2 7 5 0
p3 0 0 3 4 6 6 5 6
p4 2 3 5 4 4 3 5 6
p5 0 3 3 2 0 6 5 6

total recourses in a system (r1,r2,r3,r4)=(6,7,12,12)
(i) Calculate available resource martrix & need matrix for state of
system
(ii) determine saftey if Iexits for the system applying banker's
algorithm.
(iii) p3 request for(0,1,0,0) . does this request lead to a deadlock?

Feb 01, 2010 | Microsoft Windows Vista Home Premium with...

2 Answers

How to be solve banker algorithm?example


I m providing you this from my college notes

Banker's Algorithm


* multiple instances of resource types IMPLIES cannot use resource-allocation graph

* banks do not allocate cash unless they can satisfy customer needs when a new process enters the system

* declare in advance maximum need for each resource type

* cannot exceed the total resources of that type

* later, processes make actual request for some resources

* if the the allocation leaves system in safe state grant the resources

* otherwise, suspend process until other processes release enough resources



Banker: Data Structures define MAXN 10 /* maximum number of processes */
#define MAXM 10 /* maximum number of resource types */
int Available[MAXM]; /* Available[j] = current # of unused resource j */
int Max[MAXN][MAXM]; /* Max[i][j] = max demand of i for resource j */
int Allocation[MAXN][MAXM]; /* Allocation[i][j] = i's current allocation of j*/
int Need[MAXN][MAXM]; /* Need[i][j] = i's potential for more j */
/* Need[i][j] = Max[i][j] - Allocation[i][j] */

Notation:

X <= Y iff X[i] <= Y[i] for all i

(0,3,2,1) is less than (1,7,3,2)

(1,7,3,2) is NOT less than (0,8,2,1)

Each row of Allocation and Need are vectors: Allocation_i and Need_i



Banker: Example

Initially:

Available
A B C
10 5 7

Later Snapshot:

Max - Allocation = Need Available
A B C A B C A B C A B C
P0 7 5 3 0 1 0 7 4 3 3 3 2
P1 3 2 2 2 0 0 1 2 2
P2 9 0 2 3 0 2 6 0 0
P3 2 2 2 2 1 1 0 1 1
P4 4 3 3 0 0 2 4 3 1



Banker: Safety Algorithm

* consider some sequence of processes

* if the first process has Need less than Available

* it can run until done

* then release all of its allocated resources

* allocation is increased for next process

* if the second process has Need less than Available

* ...

* then all of the processes will be able to run eventually

* IMPLIES system is in a safe state



Banker: Safety Algorithm

STEP 1: initialize
Work := Available;
for i = 1,2,...,n
Finish[i] = false
STEP 2: find i such that both
a. Finish[i] is false
b. Need_i <= Work
if no such i, goto STEP 4
STEP 3:
Work := Work + Allocation_i
Finish[i] = true
goto STEP 2
STEP 4:
if Finish[i] = true for all i, system is in safe state



Banker: Safety Example

Using the previous example, P1,P3,P4,P2,P0 satisfies criteria.

Max - Allocation = Need <= Work Available
A B C A B C A B C A B C
P1 3 2 2 2 0 0 1 2 2 3 3 2 3 3 2
P3 2 2 2 2 1 1 0 1 1 5 3 2
P4 4 3 3 0 0 2 4 3 1 7 4 3
P2 9 0 2 3 0 2 6 0 0 7 4 5
P0 7 5 3 0 1 0 7 4 3 10 4 7
10 5 7<<< initial system



Banker: Resource-Request Algorithm

STEP 0: P_i makes Request_i for resources, say (1,0,2)
STEP 1: if Request_i <= Need_i
goto STEP 2
else ERROR
STEP 2: if Request_i <= Available
goto STEP 3
else suspend P_i
STEP 3: pretend to allocate requested resources
Available := Available - Request_i
Allocation_i := Allocation_i + Request_i;
Need_i := Need_i - Request_i
STEP 4: if pretend state is SAFE
then do a real allocation and P_i proceeds
else
restore the original state and suspend P_i



Banker: Resource-Request Algorithm [129]

Say P1 requests (1,0,2)

Compare to Need_1: (1,0,2) <= (1,2,2)

Compare to Available: (1,0,2) <= (3 3 2)

Pretend to allocate resources:

Max - Allocation = Need Available
A B C A B C A B C A B C
P0 7 5 3 0 1 0 7 4 3 2 3 0<<<
P1 3 2 2 3 0 2<<< 0 2 0<<<
P2 9 0 2 3 0 2 6 0 0
P3 2 2 2 2 1 1 0 1 1
P4 4 3 3 0 0 2 4 3 1

Is this safe? Yes: P1, P3, P4, P0, P2

Can P4 get (3,3,0)? No, (3,3,0) > (2,3,0) Available

Can P0 get (0,2,0)? (0,2,0) < (2,3,0) Available

Pretend: Available goes to (2,1,0)

Thanks And Regards

May 13, 2009 | Microsoft Windows XP Professional

Not finding what you are looking for?
Microsoft Windows XP Professional Logo

Related Topics:

1,464 people viewed this question

Ask a Question

Usually answered in minutes!

Top Microsoft Computers & Internet Experts

micky dee

Level 3 Expert

2774 Answers

Piyal Perera
Piyal Perera

Level 3 Expert

528 Answers

Les Dickinson
Les Dickinson

Level 3 Expert

18394 Answers

Are you a Microsoft Computer and Internet Expert? Answer questions, earn points and help others

Answer questions

Manuals & User Guides

Loading...