The format changed in mid-2020. Everything from 2022 onward follows one stable online template — that is what you will sit.
| Era | Exams | Format |
|---|---|---|
| 2019 – early 2020 | 3 papers | Old paper format: 6 long open-ended exercises, no per-question points. (obsolete — skip) |
| mid-2020 – 2025 | 22 papers | Current online format: 10–16 short exercises, ~31 pts, mix of multiple-choice + a few large write-code / write-script tasks. |
These appear in 22–24 of the 25 exams. The first four are large hand-written tasks worth ~16 of ~31 points — half the exam in four predictable question types.
| Topic | Frequency | Format | Avg pts |
|---|---|---|---|
| Concurrent program — semaphores / precedence graph | 23 / 25 | WRITE CODE | 4.8 |
| Bash script — text / file processing | 24 / 25 | WRITE SCRIPT | 4.7 |
| fork/exec/system output — "count the chars" | 22 / 25 | TRACE | 3.5 |
| CPU scheduling — Gantt + avg waiting time | 23 / 25 | OPEN | 3.3 |
| Deadlock — Banker's or resource-allocation graph | ~1 / exam | OPEN / MCQ | 1.5 |
The 2025 sessions (20250217, 20250612, 20250917) are nearly identical in shape. This is the layout to expect:
egrep … | tr -s | cut or find -regex/-perm → which lines print?ls -l/ps, count words/lines, find+filter+rename filesPoints-weighted across the 22 scored exams (avg points contributed per exam). Study top-down.
| Topic | Avg points per exam |
|---|---|
| Concurrent code (semaphores) | |
| Bash script | |
| fork/exec output trace | |
| CPU scheduling | |
| Synchronization theory | |
| Signals | |
| Pipes / IPC | |
| Regex / filters | |
| Process theory (zombie/orphan/PCB) | |
| File system (links/encoding/syscalls) | |
| Threads theory | |
| Deadlock — Banker's | |
| Classic sync (prod/cons, R/W) | |
| Deadlock — resource graph | |
| File allocation (bitmap) |
136 of 293 exercises are multiple-choice. They recycle a fixed concept pool — same ideas, reworded each session. Know these cold and the cheap points are free:
exec family (l/v/p/e variants)signal(SIGCHLD, SIG_IGN), kill vs shell kill, pausepthread_join / pthread_exit / return&i to a threadPIPE_BUF, SIGPIPErm; ASCII/UTF-8/binaryThe big tasks are the same templates re-skinned with new numbers. Practice the template, not individual instances:
| Slot | What recurs |
|---|---|
| CODE | Precedence graph → semaphores (most common) · implement counting semaphore from mutexes · barrier · two-thread rendezvous · reader-writer / producer-consumer · mutually-recursive thread spawning |
| SCRIPT | Parse ls -l output (size + permissions) · count words/lines per line · find + filter + rename files · kill processes from ps aux by memory · merge/split .txt files |
| TRACE | Count how often a char prints under nested fork() + execlp + system · predict admissible thread interleavings under semaphores |
| SCHED | Gantt chart for SRTF / Round Robin (most frequent) / Priority / FCFS / SJF → average waiting & turnaround |
| DEADLK | Banker's: can request be granted, give safe sequence · Graph: which edge to remove to break the cycle |