Operating Systems Laboratory
Subject Overview
The practical companion to Operating Systems, implementing CPU scheduling algorithms (FCFS, SJF, Round Robin), the Banker's algorithm for deadlock avoidance, the Producer-Consumer problem with semaphores, IPC via pipes and FIFOs, memory management techniques (paging, segmentation, best-fit, first-fit, MVT), the Dining Philosophers problem, and page replacement (FIFO) and file allocation. A 1-credit core lab paper.
Unit-wise Syllabus
1 units — click WhatsApp below to get the full notes for each
Unit 1: Scheduling, synchronization and memory management
FCFS/SJF/Round Robin CPU scheduling simulation, Banker's algorithm for deadlock avoidance, Producer-Consumer problem using semaphores, IPC via pipes and FIFOs, paging and segmentation memory management simulation, best-fit and first-fit contiguous memory allocation, Dining Philosophers problem, MVT algorithm, FIFO page replacement, sequential file allocation