T1 2019 ICT201: CPU Scheduling Algorithms and Deadlock Situations

This report delves into the core concepts of CPU scheduling algorithms and deadlock scenarios within operating systems. It begins by examining four key scheduling algorithms: First-Come, First-Served (FCFS), Shortest Job Next (SJN), Shortest Remaining Time (SRT), and Round Robin, providing timelines and ready queue formations for each. The report then defines and calculates waiting time and turnaround time for each algorithm, offering detailed calculations. Furthermore, it explores methods to resolve deadlock problems in a spooling system, proposing features like space tracking and user-allocated disk space. The report also analyzes a banking system scenario to assess the likelihood of deadlocks and discusses the applicability of a numbering request policy to prevent them. The report draws on various academic sources to support the analysis.