This study is to implement these scheduling methods and figure out the functioning of each of the methods. Processes running in a CPU may also lead to deadlock by multiple processes requesting the resources which are held by each other and to avoid that this paper studies the deadlock prevention algorithm i.e., Banker’s Algorithm which solves the issue by maximum predetermined resource allocation for the processes while being in a safe state always. This implements the algorithm for the given inputs. These methods are visualised using the graphical user interface for better understanding using HTML, CSS, JavaScript.