About this sheet
Operating System Interview Questions
The Operating Systems sheet covers processes and threads, CPU scheduling, synchronisation and deadlock, virtual memory, file systems and I/O — the systems fundamentals interviewers use to separate a user of concurrency from someone who understands it.
The sheet holds 10 patterns and 50 topics, tracked row by row. From any row you can read the theory for a topic, answer knowledge-check questions on it, have the AI coach teach it back to you, keep notes, bookmark a row and mark it done. Progress is saved against your account, so the sheet is also the record of what you have already covered.
Who it is for
It is written for candidates facing a fundamentals round, and for backend and infrastructure engineers who debug latency, contention and memory behaviour in production.
How to work through it
For each topic, be able to state the problem it solves before the mechanism that solves it. A definition of a mutex earns nothing; explaining the race it prevents, and what it costs, is the answer being asked for.
Practice runs on the same platform as the sheet: 850+ problems across every track, code execution in 6 languages, and AI mock interviews that follow the pattern you are studying rather than a random question.
What the operating systems sheet covers
Interview Soon
6 patterns, 30 topics — the ones that come up first
- What an Operating System Does — The Role of an Operating System, Kernel Mode, User Mode and Protection, System Calls, Interrupts, Traps and Exceptions, How Operating Systems Are Structured
- Processes — What a Process Is, Process States and the Process Control Block, Creating and Terminating Processes, Context Switching, Inter-Process Communication
- Threads and Concurrency — Threads and Why They Exist, Concurrency and Parallelism, Multithreading Models, Thread Pools and Common Thread Patterns, Thread Cancellation and Thread-Local Data
- CPU Scheduling — Scheduling Basics and Criteria, First-Come First-Served and Shortest Job First, Round Robin and Time Slices, Priority and Multilevel Queue Scheduling, Multiprocessor Scheduling
- Process Synchronization — Race Conditions and the Critical Section Problem, Locks and Mutexes, Semaphores, Classic Synchronization Problems, Monitors and Condition Variables
- Deadlocks — What Deadlock Is and the Four Conditions, Resource Allocation Graphs, Deadlock Prevention, Deadlock Avoidance and the Banker's Algorithm, Deadlock Detection and Recovery
Deep Dive
4 patterns, 20 topics for full coverage
- Main Memory — Address Binding and Logical vs Physical Addresses, Contiguous Allocation and Fragmentation, Paging, Page Tables and the TLB, Segmentation
- Virtual Memory — Demand Paging and Page Faults, Page Replacement Algorithms, Frame Allocation and Thrashing, Copy-on-Write and Memory-Mapped Files, Kernel Memory Allocation
- File Systems — Files, Attributes and Operations, Directories and Path Names, File Allocation Methods, Free Space Management and File System Implementation, Mounting, Protection and Sharing
- Storage and I/O Systems — Disk Structure and Performance, Disk Scheduling Algorithms, RAID and Redundancy, I/O Hardware and Device Communication, The I/O Software Stack and Buffering