Practice first
Labs
Reading about scheduling is not the same as scheduling. Each lab turns a lecture into something you can run, break, and get marked on.
FCFS, SJF, SRTF, priority, and round robin. Edit processes, watch the Gantt chart fill in tick by tick, compare averages, then solve random problems with instant marking.
Type a C program with fork, exec, wait, exit, and kill. Run it in the browser, see every process's output, the process tree, zombies and orphans, and take on the counting challenges.
Step through the Banker's safety algorithm on editable matrices, test resource requests against all three rules, and build resource-allocation graphs to hunt for cycles.
An event fires. Which state comes next? Sixty seconds, seven states, and the suspend transitions that catch everyone out.
A fake shell for revision. man any term from the glossary, run a quick scheduling calculation, or start a five-question quiz without leaving the prompt.
Timed MCQs drawn from every recap slide plus harder numericals. Per-lecture breakdown, review of mistakes, retry only the ones you missed.
Every lab has a random-problem mode. If you can score well on problems you have never seen, you are ready.