Operating Systems
Undergraduate operating systems — processes, system calls, threads, synchronization, deadlocks, scheduling, memory, page replacement, filesystems and disk scheduling — on…
Undergraduate depth: concept notes and, where they help, in-browser labs. Reading is free.
Lessons
- DeadlocksCoffman conditions, wait-for / resource-allocation graphs, Banker's algorithm and the minimum-units bound.
- Disk schedulingDisk access time and FCFS, SSTF, SCAN-family head movement.
- File systemsWhat a file is, contiguous / linked / indexed allocation, inodes and directories.
- Memory managementPaging, address translation, the TLB, demand paging and segmentation.
- Page replacementVictim choice under FIFO, LRU and Optimal, and Belady's anomaly.
- Processes and the PCBWhat a process is, the five states, the PCB, context switches, multiprogramming and how two processes exchange data.
- CPU schedulingTurnaround, waiting and response, then FCFS, SJF, SRTF, Round Robin and priority on one three-job walk.
- SynchronizationRaces, the critical-section properties, Peterson's two-process lock, semaphores and monitors.
- System calls and the process APIUser versus kernel mode, the trap that is a system call, and fork / wait / exit.
- ThreadsThreads share a process's address space; user-level versus kernel-level scheduling.
Practise Operating Systems
Reading every chapter below is free and needs no account. Practice, mocks and progress live in the app.
Continue with Google — freeNo card, no trial. Works offline once installed.