Browse all subjects

Back to Operating Systems

Operating Systems · Reading course

See what an operating system
does, one layer at a time.

Your complete Operating Systems course, from computer foundations to virtual memory, concurrency, filesystems, and a final practice test.

Start reading Explore in 3D Official CS syllabus ↗

58 reading items · 8 phases · Worked examples & practice

Download the supplied complete notes (.md) ↓

YOUR OPERATING SYSTEMS PROGRESS

0%

0 of 58 reading items completed

Complete an item when you’re ready. Your place is saved in this browser.

Your path through Operating Systems

Lessons, chapter reviews, and checkpoints—in reading order.

01Phase 0Foundations from Zero0 / 5 complete

0.1.1Inside a computer: CPU, memory, disk, I/O; bits, bytes and powers of twoLesson 0.1.2What an operating system does: kernel, user mode and kernel mode, interruptsLesson 0.1.3System calls: how programs ask the operating system for helpLesson LI-0.1Chapter 0.1 Lock-inChapter review CP-0Phase 0 Checkpoint (15 questions)Checkpoint

02Phase 1Processes & Threads0 / 7 complete

1.1.1Processes: memory layout, process control block and process statesLesson 1.1.2Creating processes with fork(), exec() and wait(); context switches and schedulersLesson LI-1.1Chapter 1.1 Lock-inChapter review 1.2.1Threads: what they share, user-level vs kernel-level threadsLesson 1.2.2Inter-process communication: shared memory, message passing and pipesLesson LI-1.2Chapter 1.2 Lock-inChapter review CP-1Phase 1 Checkpoint (15 questions)Checkpoint

03Phase 2CPU Scheduling0 / 8 complete

2.1.1Scheduling basics: the times we measure; first-come first-servedLesson 2.1.2Shortest job first and shortest remaining time firstLesson 2.1.3Priority scheduling, starvation and aging; highest response ratio nextLesson LI-2.1Chapter 2.1 Lock-inChapter review 2.2.1Round robin and the time quantumLesson 2.2.2Multilevel queues, CPU and I/O bursts, CPU utilisationLesson LI-2.2Chapter 2.2 Lock-inChapter review CP-2Phase 2 Checkpoint (15 questions)Checkpoint

04Phase 3Concurrency & Synchronization0 / 9 complete

3.1.1Race conditions and the critical-section problemLesson 3.1.2Software solutions: turn and flag attempts, Peterson's algorithmLesson 3.1.3Hardware help: test-and-set, compare-and-swap, spinlocksLesson LI-3.1Chapter 3.1 Lock-inChapter review 3.2.1Semaphores: wait, signal, counting and binary semaphoresLesson 3.2.2Classic problems: bounded buffer, readers–writers, dining philosophersLesson 3.2.3Monitors, and reasoning about concurrent codeLesson LI-3.2Chapter 3.2 Lock-inChapter review CP-3Phase 3 Checkpoint (15 questions)Checkpoint

05Phase 4Deadlock0 / 5 complete

4.1.1Deadlock: the four conditions and resource-allocation graphsLesson 4.1.2Prevention and avoidance: safe states and the banker's algorithmLesson 4.1.3Detection, recovery, and the minimum-resources formulaLesson LI-4.1Chapter 4.1 Lock-inChapter review CP-4Phase 4 Checkpoint (15 questions)Checkpoint

06Phase 5Memory Management & Virtual Memory0 / 10 complete

5.1.1Addresses and contiguous allocation: fits and fragmentationLesson 5.2.1Paging: pages, frames, page tables and the address splitLesson 5.2.2TLBs, effective access time and multilevel page tablesLesson 5.2.3Segmentation, and segmentation with pagingLesson LI-5.1-5.2Chapters 5.1–5.2 Lock-inChapter review 5.3.1Demand paging, page faults and effective access timeLesson 5.3.2Page replacement: FIFO, optimal and LRU; Belady's anomalyLesson 5.3.3Frame allocation, thrashing, working sets and the clock algorithmLesson LI-5.3Chapter 5.3 Lock-inChapter review CP-5Phase 5 Checkpoint (15 questions)Checkpoint

07Phase 6File Systems & I/O0 / 8 complete

6.1.1Files, directories and access methodsLesson 6.1.2Allocation methods: contiguous, linked (FAT), indexed (inodes); free spaceLesson LI-6.1Chapter 6.1 Lock-inChapter review 6.2.1Disk structure and access timeLesson 6.2.2Disk scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOKLesson 6.2.3I/O techniques: programmed I/O, interrupts, DMA, buffering and spoolingLesson LI-6.2Chapter 6.2 Lock-inChapter review CP-6Phase 6 Checkpoint (15 questions)Checkpoint

08Phase 7Integration & Final Test0 / 6 complete

7.1.1Master Rule Sheet (all rule cards merged)Revision 7.2.1Mixed practice set 1Revision 7.2.2Mixed practice set 2Revision 7.2.3Mixed practice set 3Revision 7.3.1GATE pattern drill: recurring patterns and fastest methodsRevision 7.4.1Final end-to-end test (30 questions, 90 min)Final test

A good way to read

01 · Think before revealingTry the Predict First and self-test questions. Open the Answer Vault when you’re ready.

02 · Keep track of understandingMark each reading item complete yourself. The reading-position bar simply shows where you are on the page.

03 · Revisit what mattersUse chapter reviews, checkpoints, and revision pages to connect ideas. The imported practice is self-checked against the supplied answers.

Your progress, your copy.

Saved in this browser. Export a backup to move your Operating Systems progress to another device.

The complete notes were supplied by the site owner. Their answers have not been independently fact-checked. Check the official GATE 2027 CS syllabus for exam scope. Reading progress is separate from the Atlas topic checklist.