Banker's Algorithm explained

Computer Science - Operating systems - Banker's Algorithm Resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources. I explain in a very precise and detailed way exactly how you go about getting the need matrix and then working through the banker's algorithm in order to find the safe sequence if it in fact exists. I was hoping to provide the easiest to follow tutorial for the bankers algorithm I could possibly come up with. I do hope this tutorial helps and that you guys enjoy the video. Thank you very much for taking the time to check out this tutorial on the bankers algorithm and please let me know if it helped and if there are any other operating systems or computer science topics you would like me to create a video for. You might also want to check out: Optimal Page Replacement    • Optimal Page Replacement Algorithm   First-in First-out Page Replacement    • (FIFO) First-in, First-out page replacement