A program that implements both deadlock avoidance using banker’s algorithm and deadlock detection. Can be in either C++ or Java.
The algorithm should be treated as a series of functions that
will be passed a series of test cases in your main function.
Inputs: allocation matrix, claim matrix, and resource vector (you will have to collect the available
vector and C-A yourself using the above inputs)
Outputs: determination of safe state (and your program’s reasoning for it) and a list of all
Need to be able to identify processes by
their number in the matrix (two dimensional array).
Your test cases should be numerous and cover all edge cases. If inputs are not formatted
properly or the sizes between matrices and vectors don't match up, your code should return info
on those inconsistencies (i.e your code is “stupid-proof”).
13 freelancers are bidding on average $56 for this job
hi. i have a lot of experience in C++ programming and java programming and operating systems concepts . i can easily complete the project for you. we can have a chat. thanks