CPU Scheduling Algorithms & Deadlock Notes – FCFS, SJF, RR, Priority, Banker's Algorithm

This unit covers CPU Scheduling and Deadlocks with solved examples. It explains CPU-IO burst cycles, scheduling criteria (utilization, throughput, turnaround time, waiting time), and major algorithms — FCFS (with a fully solved Gantt chart numerical), SJF, SRTN, Round Robin, Priority Scheduling, and Multilevel Queue Scheduling — each with pros/cons and diagrams. The second half covers Deadlocks: definition, a three-process resource example, and the four Necessary Conditions (Mutual Exclusion, Hold and Wait, No Preemption, Circular Wait). Deadlock Prevention techniques are explained step-by-step, and the unit ends with the Banker's Algorithm for deadlock avoidance, including its safe/unsafe state logic.