← Back to Semester 5 Study Compendium

CEUC301 · Core Subject · Semester 5

Fundamentals of
Operating System Design

Nine standalone chapters tracing the kernel from core abstractions down to metal. Every design choice is treated as an explicit trade-off: process & thread context switches, fair vs. real-time scheduling, hardware synchronization primitives, deadlock prevention & detection, two-level paging with TLBs, journaling file systems, disk arm elevator algorithms, and embedded RTOS constraints — with hand-verifiable traces on every page.

One foundational discipline: In every chapter, memory access penalties and CPU cycles are counted explicitly. We trace exactly what resides in user space, what traps to the kernel, and what the silicon hardware caches.
9Chapters
38Syllabus Topics
100%Offline Guides
WorkedTrace Tables
01
Unit 1 · Core Architecture · 5 sections

Operating System Design, Processes & Threads

Kernel architectures (monolithic vs microkernel), dual-mode hardware execution, PCB/TCB data structures, and the step-by-step register cycle cost of a full context switch.

1.1 Design Goals · 1.2 Kernel Architectures · 1.3 PCB & TCB Internals · 1.4 Switching Overhead · 1.5 Kernel vs. User Threads
Open →
02
Unit 2 · Scheduling Theory · 4 sections

CPU Scheduling & Performance Evaluation

Preemptive vs non-preemptive disciplines, turnaround and wait-time arithmetic (FCFS, SJF, Round Robin), multi-level feedback queues (MLFQ), and hard real-time scheduling (RMS, EDF).

2.1 Scheduling Metrics · 2.2 Classical Algorithms · 2.3 Real-Time RMS & EDF · 2.4 MLQ & MLFQ Tuning
Open →
03
Unit 3 · Concurrency · 4 sections

Synchronization & Concurrency Control

Critical section requirements, Peterson's algorithm, hardware atomic instructions (Test-and-Set, Compare-and-Swap), counting semaphores, and monitor invariants.

3.1 Race Conditions & Critical Section · 3.2 Semaphores & Monitors · 3.3 Memory Consistency · 3.4 Lock-Free Primitives
Open →
04
Unit 4 · Deadlock · 4 sections

Deadlock Modeling & System-level Handling

The four Coffman conditions, resource-allocation graphs, Banker's Safety and Request algorithms computed step-by-step, detection matrices, and recovery strategies.

4.1 Prevention & Coffman Rules · 4.2 Banker's Avoidance · 4.3 Detection & Reduction · 4.4 Livelock & Starvation
Open →
05
Unit 5 · Memory Systems · 5 sections

Memory Management System Design

Base and limit registers, contiguous partition allocation, internal vs external fragmentation, paging address translation (VPN to PPN), segmentation, and buddy/slab allocators.

5.1 Fragmentation · 5.2 Paging & Address Translation · 5.3 Buddy & Slab Systems · 5.4 Two-Level Page Tables · 5.5 Protection
Open →
06
Unit 6 · Virtual Memory · 3 sections

Virtual Memory & Page Replacement Design

Demand paging, Effective Access Time (EAT) formulas, TLB hit rates, Belady's anomaly, and page replacement algorithm comparisons (FIFO, Optimal, LRU, Second-Chance Clock).

6.1 TLB Performance & EAT · 6.2 Page Replacement (FIFO, LRU, Clock) · 6.3 Thrashing & Working-Set Model
Open →
07
Unit 7 · Storage Systems · 5 sections

File System Design & Performance

File abstractions, directory tree representations, contiguous vs linked vs indexed block allocation, Unix inode multi-level index structures, and write-ahead journaling vs log-structured FS.

7.1 Inodes & Allocation · 7.2 Journaling vs Log-Structured · 7.3 Free-Space Bitmaps · 7.4 Caching & Crash Recovery
Open →
08
Unit 8 · Hardware I/O · 5 sections

I/O Subsystem & Storage System Design

Programmed I/O vs interrupt-driven I/O vs Direct Memory Access (DMA), disk geometry physics, and disk scheduling arm traces (FCFS, SSTF, SCAN, C-SCAN, LOOK).

8.1 DMA & Bus Architecture · 8.2 Disk Geometry · 8.3 Arm Scheduling (SSTF, SCAN, C-SCAN) · 8.4 Flash SSD FTL
Open →
09
Unit 9 · Specialized Kernels · 5 sections

Specialized Operating Systems

Hard vs soft real-time guarantees, priority inversion and the Priority Ceiling Protocol, embedded sensor battery management, and mobile power-aware scheduler governors.

9.1 Hard vs Soft RTOS · 9.2 Priority Inversion & PIP · 9.3 Embedded & IoT Constraints · 9.4 Mobile Power Management
Open →
Colour contract, OS notes Traps, Page Faults, Lock Contention Hits, Fast-Path, Cache Valid Kernel Tables, Inodes, PCBs Pointers, Virtual Addresses, Focus