mplement the Banker's algorithm for deadlock avoidance, that works on a given set of N processes and M resource types (N

mplement the Banker's algorithm for deadlock avoidance, that works on a given set of N processes and M resource types (N<><10). use="" c/c++/c#="" or="" java="" for="" the="" implementation,="" with="" a="" simple="" text="" interface,="" where="" the="" user="" enters="" only="" the="" name="" of="" the="" input="" file="" (text="" only).="" the="" program="" reads="" all="" the="" necessary="" input="" data="" from="" that="" file.="" the="" input="" data="" and="" result="" is="" then="" displayed="" on="" the="" screen.="" you="" may="" use="" your="" program="" to="" validate="" the="" example="" you="" gave="" in="" the="" week="" 4="" discussion.="" deliverables:="" the="" source="" code="" +="" a="" screenshot="" of="" the="" program="" showing="" an="" execution="" example="" +="" the="" list="" of="" all="" available="" solutions="" for="" the="" example="" posted="" in="" the="" week="" 4="" discussions="" area.="" important:="" the="" grading="" scale="" for="" this="" assignment="" is="" all="" follows:="" -="" max="" score="" is="" 70%="" if="" you="" use="" a="" greedy="" approach="" (will="" find="" one="" solution,="" but="" not="" always).="" -="" max="" score="" is="" 100%="" if="" you="" use="" backtracking="" and="" find="" all="">


Homework 4 Implement the Banker's algorithm for deadlock avoidance, that works on a given set of N processes and M resource types (N<><10). use c/c++/c# or java for the implementation, with a simple text interface, where the user enters only the name of the input file (text only). the program reads all the necessary input data from that file. the input data and result is then displayed on the screen. you may use your program to validate the example you gave in the week 4 discussion. deliverables: the source code + a screenshot of the program showing an execution example + the list of all available solutions for the example posted in the week 4 discussions area. important: the grading scale for this assignment is all follows: - max score is 70% if you use a greedy approach (will find one solution, but not always). - max score is 100% if you use backtracking and find all solutions use="" c/c++/c#="" or="" java="" for="" the="" implementation,="" with="" a="" simple="" text="" interface,="" where="" the="" user="" enters="" only="" the="" name="" of="" the="" input="" file="" (text="" only).="" the="" program="" reads="" all="" the="" necessary="" input="" data="" from="" that="" file.="" the="" input="" data="" and="" result="" is="" then="" displayed="" on="" the="" screen.="" you="" may="" use="" your="" program="" to="" validate="" the="" example="" you="" gave="" in="" the="" week="" 4="" discussion.="" deliverables:="" the="" source="" code="" +="" a="" screenshot="" of="" the="" program="" showing="" an="" execution="" example="" +="" the="" list="" of="" all="" available="" solutions="" for="" the="" example="" posted="" in="" the="" week="" 4="" discussions="" area.="" important:="" the="" grading="" scale="" for="" this="" assignment="" is="" all="" follows:="" -="" max="" score="" is="" 70%="" if="" you="" use="" a="" greedy="" approach="" (will="" find="" one="" solution,="" but="" not="" always).="" -="" max="" score="" is="" 100%="" if="" you="" use="" backtracking="" and="" find="" all="">