Operating Systems
Subject Overview
Operating Systems covers OS structure and services, process management (states, scheduling, threads), CPU scheduling algorithms (FCFS, SJF, Round Robin), process synchronization and deadlocks (Banker's algorithm), and memory management from paging/segmentation through virtual memory and page replacement, closing with I/O and disk scheduling. A 3-credit core theory paper.
Unit-wise Syllabus
4 units — click WhatsApp below to get the full notes for each
Unit 1: OS overview and structure
Definition, evolution, components and services of an OS, structure and architecture, batch systems, multiprogramming, time-sharing, parallel, distributed and real-time systems, OS services and system calls, system programs, OS generations
Unit 2: Process management and scheduling
Process definition, states and state transitions, process scheduling, PCB, threads and multithreading, scheduling objectives and algorithms, preemptive/non-preemptive CPU scheduling (FCFS, SJF, Round Robin), performance evaluation of scheduling algorithms
Unit 3: Synchronization and deadlocks
Inter-process communication, race conditions, critical section problem, mutual exclusion, semaphores, monitors, deadlock system model and characterization, prevention, avoidance, Banker's algorithm, deadlock detection and recovery
Unit 4: Memory and I/O management
Logical and physical address mapping, swapping, memory allocation, MFT/MVT, internal/external fragmentation and compaction, paging, segmentation, demand paging, page replacement algorithms, frame allocation, thrashing, I/O hardware principles, disk structure and scheduling algorithms