How to Study Operating Systems: 10 Proven Techniques

How to apply this:

For the chapter on virtual memory, read the explanation of page tables, then immediately attempt the address translation exercises: given virtual address 0x3A7F with 4KB pages and 2-level page tables, extract the page directory index, page table index, and offset. Check your work against the solution. If wrong, re-read the specific section that covers your error.

How to apply this:

Given: 32-bit virtual address space, 4KB pages, 2-level page tables. Translate virtual address 0x0040_1234: split into directory index (bits 22-31 = 0x001), page table index (bits 12-21 = 0x001), offset (bits 0-11 = 0x234). Look up PDE at cr3 + 0x001*4, get PTE base, look up PTE, get physical frame, append offset. Practice 5 different addresses until automatic.

How to apply this:

Write a C program with two threads incrementing a shared counter 1,000,000 times each without synchronization. Run it 10 times and observe different final values. Then add a mutex and verify the result is always 2,000,000. Next, create a deliberate deadlock with two mutexes acquired in different orders. Use Helgrind (Valgrind tool) to detect it automatically.

How to apply this:

Given processes: P1(arrival=0, burst=8), P2(arrival=1, burst=4), P3(arrival=2, burst=2), P4(arrival=3, burst=1). Draw Gantt charts for FIFO, SJF, and Round Robin (quantum=2). Calculate average turnaround and response time for each. Notice how SJF minimizes turnaround but RR minimizes response time — this tradeoff is the core insight.

How to apply this:

Build a simple Unix shell in C that supports: executing commands with fork/exec, input/output redirection with dup2, piping between two commands, and background processes with &. Start with just fork/exec, then add features incrementally. The MIT xv6 labs are excellent structured projects even if you're not enrolled.

How to apply this:

Run 'strace ls -la' and identify: openat() to read directory entries, fstat() to get file metadata, write() to output to terminal. Then trace a simple Python script and observe how many system calls even a trivial program makes. Count the mmap() calls and understand that each one is the OS mapping a shared library into your process's address space.

How to apply this:

Given: P1 holds R1 and requests R2, P2 holds R2 and requests R3, P3 holds R3 and requests R1. Draw the resource allocation graph with process nodes, resource nodes, assignment edges, and request edges. Identify the cycle P1→R2→P2→R3→P3→R1→P1 — this is deadlock. Then apply the Banker's Algorithm to determine a safe execution sequence for a given resource state.

How to apply this:

Draw an ext2-like file system layout. To resolve /home/user/file.txt: read root inode (inode 2) → find 'home' entry in root's data blocks → read home's inode → find 'user' entry → read user's inode → find 'file.txt' entry → read file.txt's inode → read its data blocks. Count how many disk reads this requires and explain why directory caching matters.

How to apply this:

Implement a bounded buffer with one producer and one consumer using pthreads. First attempt with only mutexes (this will busy-wait). Then add condition variables for proper blocking. Then reimplement using POSIX semaphores. Compare the three implementations and understand why condition variables are preferred over busy-waiting.

How to apply this:

Analogy: Virtual memory is like a library (physical memory) with a catalog system (page table). Books on the shelves are frames in RAM, books in the warehouse are pages on disk. The catalog maps call numbers (virtual addresses) to shelf locations (physical addresses). When a requested book isn't on the shelf (page fault), the librarian fetches it from the warehouse (disk) and may need to return another book to make room (page replacement). Where does this break down? (Shared memory, copy-on-write.)