All projects

PROJECT 09 / Operating Systems & Systems Programming

Operating System Algorithms

A collection of 27 C lab programs exploring CPU and disk scheduling, memory management, deadlocks, process creation, and buffer behaviour.

WHEN

Coursework collection

CONTRIBUTION

Operating systems lab collection

TECHNOLOGIES
CPOSIXCPU schedulingPage replacementDeadlock handling
OPERATING SYSTEMS & SYSTEMS PROGRAMMING09
OPERATING SYSTEMSTrace every decision.
C lab programs · POSIX process examplesSchedule CPU time → serve disk requests
Replace pages → inspect resource safety
27 programs6 core areas9 lab documents

Conceptual overview of scheduling, memory, and resource-management lab exercises.

THE PROJECT AT A GLANCE

Follow the scheduling decision. Inspect the system state.

Conceptual overview of scheduling, memory, and resource-management lab exercises.

Standalone C programs
27
Lab documents
9
Core topic areas
6

01 / OBJECTIVE

What the project set out to do

Make operating system policies concrete through interactive simulations, process examples, and worked lab outputs that can be traced by hand.

02 / MY CONTRIBUTION

My part in the work

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

How it came together

01

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.

02

Trace memory and resource 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.

03

Inspect process and buffer behaviour

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

What the work produced

  • Collected examples across scheduling, memory, deadlocks, process creation, and synchronization concepts.
  • Linked programs to worked lab outputs and hand-calculable operating system metrics.
  • Documented compiler requirements, platform assumptions, and known implementation issues.

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.

UP NEXT / PROJECT 10

Artificial Intelligence Basics

View case study

Want to talk about this project?

Get in touch