Computer Engineering is coming soon

We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.

Computer Engineering

Operating Systems

Processes, scheduling, synchronisation, deadlocks, memory, files and disks.

Interview questions
Your progress in this subject0 of 19 · 0%
  1. 1Operating system objectives, functions and typesOperating system objectives, functions and types — what an OS must provide, the services it gives, and the major classification of OS designs and families.
  2. 2System calls and OS servicesSystem calls are the controlled interface user programs use to request operating-system services; this note explains how they work, common services, the syscall mechanism, and shows small C programs using syscalls.
  3. 3OS structures: layered, monolithic and microkernelClear, exam-focused notes comparing layered, monolithic and microkernel OS structures, with definitions, diagrams to draw, formulas for basic overheads, worked exam-style answers and quick checks.
  4. 4Linux components and basic shell commandsConcise study notes on Linux architecture (kernel, user space, daemons, init, VFS, drivers) and basic shell commands, with definitions, command syntax to remember, worked examples and exam tips.
  5. 5Processes, process states and the PCBProcesses, their possible states, state transitions and the Process Control Block (PCB) — what a process is, how an OS tracks it, and how context switching saves and restores a PCB.
  6. 6CPU scheduling: FCFS, SJF, round robin and priorityCPU scheduling policies (FCFS, SJF, Round Robin, Priority): definitions, trade-offs, exact formulas, proofs (SJF optimality by exchange), Gantt-chart drawing instructions, worked numerical examples, common exam mistakes and practice questions.
  7. 7The critical-section problemClear, exam-oriented notes on the critical-section problem: definitions, formal requirements (mutual exclusion, progress, bounded waiting), typical failed solutions, a correct solution sketch (Peterson), worked model answers, common mistakes and exam tips.
  8. 8Semaphores, mutexes and monitorsClear, exam-focused notes on semaphores, mutexes and monitors: definitions, exact laws, proofs, C examples (pthreads), common mistakes and likely exam questions.
  9. 9Classic synchronisation problemsClassic synchronization problems (producer-consumer, readers-writers, dining philosophers) show how to coordinate concurrent processes/threads to avoid races, ensure mutual exclusion, progress and bounded waiting; engineers use these patterns to design correct concurrent systems and pick appropriate
  10. 10Inter-process communicationInter-process communication (IPC) is the set of OS-provided techniques processes use to exchange data and synchronise; engineers use IPC to coordinate components, share results and implement client-server and concurrent designs.
  11. 11Deadlocks: conditions, prevention and avoidanceDeadlocks occur when processes wait forever for resources; engineers must detect, prevent, or avoid them to keep systems correct and available.
  12. 12Banker's algorithmBanker's algorithm is a deadlock-avoidance method that grants resource requests only when doing so leaves the system in a safe state (one where a sequence of process completions exists).
  13. 13Deadlock detection and recoveryDeadlock detection and recovery: how an OS finds processes stuck waiting for each other and how it recovers (algorithms, proofs, examples).
  14. 14Memory allocation and fragmentationCovers how OSes assign RAM to processes, the types and causes of fragmentation, allocation algorithms (first/best/worst-fit, buddy), compaction and paging trade-offs, with formulas and exam-style examples.
  15. 15Virtual memory and demand pagingVirtual memory allows a program to use more memory than physical RAM by presenting a uniform virtual address space mapped to physical frames and loading pages on demand (demand paging).
  16. 16Page replacement: FIFO, LRU and optimalPage replacement decides which memory page to evict when a page fault occurs; common policies are FIFO, LRU and Optimal (clairvoyant) — understanding them is essential to predict page-fault behaviour, explain Belady's anomaly, and compute hit/miss rates for virtual memory systems.
  17. 17ThrashingThrashing is the pathological condition where an operating system spends most of its time swapping pages in and out of memory instead of executing processes; it is detected and controlled by working-set and page-fault–frequency ideas.
  18. 18File systems: organisation, directories and allocationClear, exam-focused notes on file-system organisation: files, directories, allocation methods (contiguous, linked, indexed, FAT, extents), free-space management and directory implementation, with formulas and worked examples.
  19. 19Disk structure and disk schedulingDisk structure defines how data is physically organised on rotating disks (platters, tracks, sectors, cylinders, heads) and disk scheduling algorithms (FCFS, SSTF, SCAN/LOOK, C-SCAN/C-LOOK) decide the order of servicing I/O requests to minimise access time.

Coming next in Operating Systems

  1. Context switching and schedulers· notes coming
  2. Threads and multithreading· notes coming
  3. Paging and segmentation· notes coming
  4. File systems in practice: FAT, NTFS, ext and HFS· notes coming
  5. Peterson's solution· notes coming
  6. Translation lookaside buffer· notes coming
  7. Copy-on-write· notes coming
  8. File access methods· notes coming
  9. I/O organisation· notes coming
  10. Distributed and network operating systems· notes coming
  11. Real-time operating systems· notes coming
  12. Mobile and cloud operating systems· notes coming
  13. Virtual machines· notes coming
  14. Multiprocessor scheduling· notes coming
  15. Free-space management· notes coming
  16. Swap-space management· notes coming
  17. I/O buffering and the disk cache· notes coming
  18. Multiprocessor operating systems· notes coming
  19. Real-time scheduling: rate-monotonic and EDF· notes coming
  20. File-system encryption· notes coming
  21. Multilevel feedback queue· notes coming
  22. UNIX i-nodes and the super block· notes coming
  23. UNIX file system calls· notes coming