Operating Systems
Operating Systems is one of the highest-weighted GATE CS subjects. These lessons explain each topic with figures and worked examples, use small simulators to show exactly how scheduling, paging and disk algorithms behave, and end with GATE-style questions whose numerical answers are recomputed by a program.
1Basics
2Process Management
3Synchronization
- Process SynchronizationRace conditions, the critical-section problem, Peterson's solution, hardware locks and semaphores.
- Classic Synchronization ProblemsProducer-consumer, readers-writers and dining philosophers solved with semaphores.
- DeadlocksThe four necessary conditions, resource-allocation graphs, prevention, avoidance with the Banker's algorithm, and detection.
4Memory Management
- Memory Management BasicsLogical vs physical addresses, contiguous allocation, first/best/worst fit, and fragmentation.
- Paging, TLBs and Page TablesSplitting addresses into page number and offset, effective access time with a TLB, page table sizes and multilevel paging.
- Virtual Memory and Page ReplacementDemand paging, page faults, FIFO, LRU and Optimal replacement, Belady's anomaly and thrashing.