Operating Systems Knowledge Graph

This dependency map helps you see prerequisites, next steps, and cross-topic links before starting a new concept.

Concept dependency map

Arrow means dependency direction: A -> B means A should be learned before B.

Chapter 1: Introduction to Operating Systems

What Is an Operating System?

Prerequisites: None

Next: OS Roles, Kernel Mode, and User Mode, OS Services and System Calls, OS Roles, Kernel Mode, and User Mode, OS Services and System Calls, Types of Operating Systems

OS Services and System Calls

Prerequisites: What Is an Operating System?, OS Roles, Kernel Mode, and User Mode, What Is an Operating System?, OS Roles, Kernel Mode, and User Mode

Next: OS Structures and Processing Models, OS Structures and Processing Models

Types of Operating Systems

Prerequisites: What Is an Operating System?

Next: OS Structures and Processing Models, OS Structures and Processing Models

OS Structures and Processing Models

Prerequisites: OS Services and System Calls, Types of Operating Systems, Types of Operating Systems, OS Services and System Calls

Next: Process Concept, States, and Transitions, Process Concept, States, and Transitions

Chapter 2: Process and Thread Management

Process Concept, States, and Transitions

Prerequisites: OS Structures and Processing Models, OS Structures and Processing Models

Next: PCB and Context Switching, Scheduling Goals and Scheduler Types, PCB and Context Switching, Scheduling Goals and Scheduler Types, IPC Models and Race Conditions

PCB and Context Switching

Prerequisites: Process Concept, States, and Transitions, Process Concept, States, and Transitions

Next: Threads and Multithreading Models, CPU Scheduling Algorithms (FCFS, RR, SJF, SRTN, Priority), Threads and Multithreading Models, CPU Scheduling Algorithms (FCFS, RR, SJF, SRTN, Priority)

Threads and Multithreading Models

Prerequisites: PCB and Context Switching, PCB and Context Switching

Next: Scheduling Goals and Scheduler Types, IPC Models and Race Conditions

Scheduling Goals and Scheduler Types

Prerequisites: Process Concept, States, and Transitions, Threads and Multithreading Models, Process Concept, States, and Transitions

Next: CPU Scheduling Algorithms (FCFS, RR, SJF, SRTN, Priority), CPU Scheduling Algorithms (FCFS, RR, SJF, SRTN, Priority)

CPU Scheduling Algorithms (FCFS, RR, SJF, SRTN, Priority)

Prerequisites: PCB and Context Switching, Scheduling Goals and Scheduler Types, Scheduling Goals and Scheduler Types, PCB and Context Switching

Next: IPC Models and Race Conditions, Deadlock, Prevention, Detection, and Banker's Algorithm

Chapter 3: Inter-process Communication and Deadlock

IPC Models and Race Conditions

Prerequisites: CPU Scheduling Algorithms (FCFS, RR, SJF, SRTN, Priority), Process Concept, States, and Transitions, Threads and Multithreading Models

Next: Critical Section Solutions (Busy Waiting and Beyond), Critical Section Solutions (Busy Waiting and Beyond)

Semaphores and Producer-Consumer

Prerequisites: Critical Section Solutions (Busy Waiting and Beyond), Critical Section Solutions (Busy Waiting and Beyond)

Next: Readers-Writers, Dining Philosophers, Monitors, Pipes, Readers-Writers, Dining Philosophers, Monitors, Pipes, Deadlock, Prevention, Detection, and Banker's Algorithm, DMA and Buffering

Deadlock, Prevention, Detection, and Banker's Algorithm

Prerequisites: Readers-Writers, Dining Philosophers, Monitors, Pipes, Semaphores and Producer-Consumer, CPU Scheduling Algorithms (FCFS, RR, SJF, SRTN, Priority)

Next: Memory Concepts and Abstraction, Memory Concepts and Abstraction

Chapter 4: Memory Management

Memory Concepts and Abstraction

Prerequisites: Deadlock, Prevention, Detection, and Banker's Algorithm, Deadlock, Prevention, Detection, and Banker's Algorithm

Next: Memory Allocation and Free-Space Management, Logical vs Physical Address and Relocation, Memory Allocation and Free-Space Management, Logical vs Physical Address and Relocation

Memory Allocation and Free-Space Management

Prerequisites: Memory Concepts and Abstraction, Memory Concepts and Abstraction

Next: Logical vs Physical Address and Relocation, Paging, Demand Paging, and TLB, Paging, Demand Paging, and TLB

Logical vs Physical Address and Relocation

Prerequisites: Memory Concepts and Abstraction, Memory Allocation and Free-Space Management, Memory Concepts and Abstraction

Next: Paging, Demand Paging, and TLB, Paging, Demand Paging, and TLB

Paging, Demand Paging, and TLB

Prerequisites: Memory Allocation and Free-Space Management, Logical vs Physical Address and Relocation, Logical vs Physical Address and Relocation, Memory Allocation and Free-Space Management

Next: Page Replacement and Segmentation, Page Replacement and Segmentation

Page Replacement and Segmentation

Prerequisites: Paging, Demand Paging, and TLB, Paging, Demand Paging, and TLB

Next: I/O Devices and I/O Techniques, I/O Devices and I/O Techniques

Chapter 5: I/O and File Management

I/O Devices and I/O Techniques

Prerequisites: Page Replacement and Segmentation, Page Replacement and Segmentation

Next: DMA and Buffering, Disk Arm Scheduling Algorithms, DMA and Buffering, File Management and File-System Structures

DMA and Buffering

Prerequisites: I/O Devices and I/O Techniques, I/O Devices and I/O Techniques, Semaphores and Producer-Consumer

Next: Disk Arm Scheduling Algorithms, Disk Arm Scheduling Algorithms

Disk Arm Scheduling Algorithms

Prerequisites: I/O Devices and I/O Techniques, DMA and Buffering, DMA and Buffering

Next: RAID and Disk Cache, RAID and Disk Cache

RAID and Disk Cache

Prerequisites: Disk Arm Scheduling Algorithms, Disk Arm Scheduling Algorithms

Next: File Management and File-System Structures, File Management and File-System Structures