All study guides

Operating Systems

Processes, CPU scheduling, synchronization, deadlocks, memory, paging and virtual memory, with solved problems.

  • 27 topics · 32 diagrams
  • ~87 min in total
  • A quick test in every topic

Not started yet

Start reading

Module 1OS Fundamentals, Architecture & System Booting

  1. 1.1Operating System Definitions & Core FunctionsAn Operating System (OS) is a collection of system software that manages all hardware and software resources of a computer system, providing an…
  2. 1.2Classification & Types of Operating SystemsOperating systems are categorized into distinct operational paradigms—including Single Process, Batch Processing, Multiprogramming, Multitasking,…
  3. 1.3System Booting Process (BIOS, UEFI, POST, MBR & Bootloader)The Boot Process is the sequential sequence of hardware initialization and software execution steps performed by a computer system from the instant power…

Module 2Computer Architecture & Kernel Design

  1. 2.1Storage Hierarchy & 32-bit vs 64-bit SystemsThe Storage Hierarchy arranges computer memory technologies based on access speed, monetary cost per bit, storage capacity, and volatility. System…
  2. 2.2Kernel Architecture & User SpaceThe Kernel is the core, central component of an operating system that loads first upon startup, runs in a privileged processor hardware state (Kernel…
  3. 2.3System Calls & System Call Interface (SCI)A System Call is a formal programmatic mechanism through which an application program executing in user mode requests privileged services—such as hardware…

Module 3Process & Thread Management

  1. 3.1Programs, Processes & Process Memory ArchitectureA Program is a passive executable file stored on secondary disk storage containing compiled machine code instructions. A Process is an active program…
  2. 3.2Process Control Block (PCB) & Process StatesA Process Control Block (PCB) is a vital operating system data structure allocated for every process that stores its operational metadata, including…
  3. 3.3Schedulers, Swapping, Context Switching, Orphan & Zombie ProcessesSwapping is a memory management mechanism where a medium-term scheduler temporarily moves inactive processes out of primary RAM onto secondary disk…
  4. 3.4Threads, Multithreading & Thread SynchronizationA Thread is the smallest independent unit of CPU execution within a process, characterized by its own Thread ID, Program Counter, register set, and stack,…

Module 4CPU Scheduling Algorithms

  1. 4.1CPU Scheduling Criteria & Core Performance MetricsCPU Scheduling is the process by which the short-term operating system scheduler dispatches CPU execution time among processes residing in the ready…
  2. 4.2FCFS & Convoy Effect, SJF & SRTF, Priority & AgingFirst-Come, First-Served (FCFS): Non-preemptive algorithm that dispatches CPU time strictly by arrival order. Convoy Effect: A performance hazard in FCFS…
  3. 4.3Round Robin (RR), MLQ & MLFQ SchedulersRound Robin (RR): A preemptive CPU scheduling algorithm designed for time-sharing systems where each process gets a small fixed slice of CPU time (Time…

Module 5Process Synchronization & Concurrency Problems

  1. 5.1Critical Section Problem, Race Conditions & Mutex LocksThe Critical Section (CS) is a segment of code in concurrent programming where threads or processes access shared resources (shared variables, memory,…
  2. 5.2Condition Variables & Semaphores (Binary vs. Counting)A Condition Variable is a synchronization primitive that enables threads to suspend execution and yield locks until a specific application state condition…
  3. 5.3Classic Concurrency Problems (Producer-Consumer, Readers-Writers, Dining Philosophers & Code Problems)Classic Concurrency Problems are fundamental benchmark synchronization challenges—including the Producer-Consumer (Bounded-Buffer) Problem,…

Module 6Deadlocks

  1. 6.1Resource Allocation & 4 Necessary Conditions of DeadlockA Deadlock is a severe system condition in a multiprogramming environment where two or more processes are permanently blocked because each process holds a…
  2. 6.2Deadlock Prevention, Avoidance & Banker's AlgorithmDeadlock Prevention enforces static structural constraints on resource requests to invalidate at least one of the four necessary deadlock conditions.…
  3. 6.3Deadlock Detection, Wait-For Graphs & Recovery StrategiesDeadlock Detection is the process of periodically executing kernel routines to inspect resource allocation states and identify existing cycles or…

Module 7Memory Management & Allocation

  1. 7.1Logical vs. Physical Address Space & MMULogical Address (Virtual Address) is a memory address generated by the CPU during instruction execution. Physical Address is the actual physical hardware…
  2. 7.2Contiguous Memory Allocation (Fixed vs Dynamic Partitioning)Contiguous Memory Allocation is a memory management scheme where each process is contained in a single continuous block of physical RAM addresses. It is…
  3. 7.3Free Space Management, Allocation Algorithms & CompactionFree Space Management is the system mechanism used by an operating system to track unallocated memory blocks (free holes) using data structures such as…

Module 8Paging, Segmentation & Virtual Memory

  1. 8.1Paging Architecture, Page Tables & TLBPaging is a non-contiguous memory management scheme that divides physical RAM into fixed-size blocks called Frames and logical program memory into…
  2. 8.2Segmentation & Hybrid Paged-SegmentationSegmentation is a memory management scheme that views memory from the user's perspective, partitioning a process into variable-sized logical modules…
  3. 8.3Virtual Memory, Demand Paging & Page Fault HandlingVirtual Memory is a memory management technique that enables the execution of processes that are not completely loaded into physical RAM by treating a…
  4. 8.4Page Replacement Algorithms & Belady's AnomalyPage Replacement Algorithms are OS kernel strategies used during a Page Fault to decide which physical frame's page to swap out when all physical RAM…
  5. 8.5Thrashing, Locality Model & Working Set ModelThrashing is a severe operating system degradation condition that occurs when a process lacks sufficient physical frames to support its active pages,…