| Topic | Task | Related/ Additional |
|---|---|---|
| Prerequisites | [PB]link | [PB]OS Introduction, [PB]Manual, [SDB]link |
| Producer Consumer | [PB]link | |
| Inter Process Communication | [PB]link | [SDB}link |
| CPU Scheduling Algorithms | [PB]Write a C program to simulate FCFS, SJF, Round Robin, and Priority scheduling algorithms. | |
| Multi-level Queue Scheduling | [PB]Simulate multi-level queue scheduling with system and user processes. | |
| File Allocation Strategies | [PB]Simulate sequential, linked, and indexed file allocation strategies. | |
| Memory Management Techniques | [PB]Simulate MVT and MFT memory management techniques. | |
| Contiguous Memory Allocation | [PB]Simulate worst-fit, best-fit, and first-fit contiguous memory allocation. | |
| Paging Technique | [PB]Simulate paging technique of memory management. | |
| File Organization Techniques | [PB]Simulate single-level, two-level, and hierarchical file organization. | |
| Deadlock Management | [PB]Simulate Bankers algorithm for deadlock avoidance. | |
| Disk Scheduling Algorithms | [PB]Simulate FCFS, SCAN, and C-SCAN disk scheduling algorithms. | |
| Page Replacement Algorithms | [PB]Simulate FIFO, LRU, LFU, and Optimal page replacement algorithms. | |
| Process Synchronization | [PB]Simulate the producer-consumer and Dining-Philosophers problems using semaphores. | |
| Lab Questions |