Question about IBM Computers & Internet

Open Question

Bankers algorithm cpp source code - IBM Computers & Internet

Posted by on

5 Suggested Answers

PegBox60965
  • 51 Answers

SOURCE: source code for DES algorithm in c++

O.K. but next time do yourself a favor: GOOGLE it. You'll find this reference on the first page:
https://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=8098&lngWId=3

Enjoy!

Posted on Dec 29, 2008

  • 2 Answers

SOURCE: give me the java source code of fuzzy c means

can u have java project or not

Posted on Apr 24, 2009

  • 1 Answer

SOURCE: i want priority scheduling algorithm in c++ codes

Do da fool 4 user enterd no. of students. Find da avg 4 a student of his marks in 3 subs print whether he passed or failed. A student wil fail if his avg<50. Use for loop given no.s

Posted on Jun 04, 2009

  • 10406 Answers

SOURCE: c program for banking algorithm to find deadlock.

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

Posted on Dec 02, 2009

  • 1 Answer

SOURCE: how to be solve banker algorithm?example

w@nt @nnim@tion

Posted on Apr 04, 2010

Add Your Answer

Uploading: 0%

my-video-file.mp4

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

×

Loading...
Loading...

Related Questions:

1 Answer

I am looking for a motion recognition system with source code. If anyone can help me


Hi,
Here are a few links to get you started:
Video Motion Detection
iSpy
Home surveillance security system
Open Source C# Surveillance Software and Motion Detection

To get more detailed help, please include:
1. The device that you will use for motion detection, e.g webcam, infra-red sensors etc
2. The programming language that you want the source code. Alternatively, you can extract the algorithm from one language and re-write it into your programming language of choice.

Best Wishes.

Mar 06, 2011 | 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...

1 Answer

Generate prime nos upto n


Just do a search for Sieve of Eratosthenes to find an efficient algorithm for finding prime numbers. You can probably find source code in multiple languages for this purpose as well.

Jul 06, 2009 | Microsoft Computers & Internet

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

1 Answer

C program for banking algorithm to find deadlock.


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

Apr 17, 2009 | Microsoft Windows XP Professional

1 Answer

I want priority scheduling algorithm in c++ codes and java source codes


Do da fool 4 user enterd no. of students. Find da avg 4 a student of his marks in 3 subs print whether he passed or failed. A student wil fail if his avg<50. Use for loop given no.s

Mar 24, 2009 | Computers & Internet

1 Answer

Source code for DES algorithm in c++


O.K. but next time do yourself a favor: GOOGLE it. You'll find this reference on the first page:
https://www.planet-source-code.com/vb/scripts/ShowCode.asp?txtCodeId=8098&lngWId=3

Enjoy!

Dec 29, 2008 | Computers & Internet

1 Answer

File handling


Use copy,  (or cp in linux),  it's a C program,  if you want you can find the source code if you are resourceful.  see below.  If you want a c++ program source code, take the source you found and do "rename copy.c copy.cpp" ;~).  It is silly to use an OO language to do a trivial utility.
see usage below:

C:\Users\ajm>ver > file1
C:\Users\ajm>ver > file2

C:\Users\ajm>copy file1+file2 file3 file1 file2         1 file(s) copied.
C:\Users\ajm> C:\Users\ajm>dir file*  Volume in drive C is SQ004740V04  Volume Serial Number is 72CF-0846
 Directory of C:\Users\ajm
11/06/2008  09:51 AM                40 file1 11/06/2008  09:51 AM                40 file2 11/06/2008  09:51 AM                81 file3                3 File(s)            161 bytes                0 Dir(s)  79,747,624,960 bytes free

Oct 30, 2008 | Computers & Internet

1 Answer

C++ quick sorting technique using templates


I found a couple of examples on the net regarding this. I have seen this work pretty well in the past. http://www.codeguru.com/cpp/cpp/cpp_mfc/collections/article.php/c883/

Feb 27, 2008 | Computers & Internet

Not finding what you are looking for?
Computers & Internet Logo

Related Topics:

1,387 people viewed this question

Ask a Question

Usually answered in minutes!

Top IBM Computers & Internet Experts

Brian Sullivan
Brian Sullivan

Level 3 Expert

27725 Answers

Les Dickinson
Les Dickinson

Level 3 Expert

18334 Answers

Donald DCruz
Donald DCruz

Level 3 Expert

17129 Answers

Are you an IBM Computer and Internet Expert? Answer questions, earn points and help others

Answer questions

Manuals & User Guides

Loading...