Compare scheduling policies
Explore FCFS, SJF, priority, Round Robin, and SRTF CPU scheduling. Compare six disk scheduling policies through service order and head movement, and use waiting and turnaround times to explain CPU scheduling decisions.
PROJECT 09 / Operating Systems & Systems Programming
A collection of 27 C lab programs exploring CPU and disk scheduling, memory management, deadlocks, process creation, and buffer behaviour.
Coursework collection
Operating systems lab collection
Schedule CPU time → serve disk requests
Replace pages → inspect resource safetyConceptual overview of scheduling, memory, and resource-management lab exercises.
THE PROJECT AT A GLANCE
Conceptual overview of scheduling, memory, and resource-management lab exercises.
01 / OBJECTIVE
Make operating system policies concrete through interactive simulations, process examples, and worked lab outputs that can be traced by hand.
02 / MY CONTRIBUTION
My operating systems collection contains 27 standalone C programs and nine lab documents. It brings together scheduling policies, page replacement, resource safety checks, POSIX process examples, and producer–consumer buffer demonstrations, with a guide to inputs, outputs, and implementation assumptions.
Academic lab material supported by Word documents containing code, command references, and output screenshots. Each C file is a separate program; the Linux and shell exercises are stored in the documents.
03 / TECHNICAL APPROACH
Explore FCFS, SJF, priority, Round Robin, and SRTF CPU scheduling. Compare six disk scheduling policies through service order and head movement, and use waiting and turnaround times to explain CPU scheduling decisions.
Follow FIFO, LRU, and optimal page replacement through frame states and page faults. Inspect allocation, need, and request matrices in Banker safety checks and deadlock detection.
Use POSIX fork examples to follow parent and child execution. Contrast real process creation with the menu-driven producer–consumer simulations, whose integer helpers do not implement concurrent synchronization.
04 / OUTCOMES
Preserved coursework examples with known limitations. Some programs need header, syntax, initialization, or algorithm corrections before use. Producer–consumer examples demonstrate buffer state in one process rather than working concurrent synchronization.
Want to talk about this project?
Get in touch