This page will be modified from time to time. If you have missed any
class, refer to the coverage notes below. Discuss with your friends for
further details. Class coverage may be more than what is mentioned here.
Leture Notes
1. Introduction to Operating Systems
2. Processes
3. Introduction to Process Scheduling
4. The FCFS and The SJF
5. Predictive SJF, SRTF, Round Robin
6. Priority Scheduling
7. Priority Scheduling in Unix Systems
8. Priority Inversion and Priority Inheritance
9. Process Synchronization: Critical
Sections
10. Continued Attempts for Critical Sections
11. Developing the Dekker's Algorithm
12. Peterson's Algorithm
13. Crirical Sections with Hardware Primitives
14. An n process solution with Test and
Set
15. Lamport's Bakery Algorithm: An n
process solution
16. Semaphore Abstractions of Dijkstra
and their implementation
17. Benchmark Synchronization problems
18. Discussion on Quiz I
19. Critical Regions, Conditional Critical
Regions and Monitiors
20. Monitor based solutions
21. Monitor implementation
22. Discussion on the Midsem paper
23. Introduction to Deadlocks
24. Deadlock Prevention
25. Characterizing Deadlocks
26. Deadlock Avoidance
27. Deadlock Detection and Recovery
28. Introduction to Memory Managemnent
29. Contiguous Allocation
30. Paging: Noncontiguous Allocation
31. Inverted Page Tables and Segmentation
32. Demand Paging
33. Page Replacement
34. Inclusion Property, Thrashing, Working Set Model
35. Kernel Memory Allocation
36. Disk Scheduling
37. File Systems and their implementation
38. Protection
39. Security Concerns
40. Some Issues in Distributed OS
Special Tutorials
1. Tutorial I on IPC
2. Tutorial II on IPC
3. Tutorial on Threads
Laboratory Assignments
Assignment 1 (Introduction to processes)
Assignment 2 (Scheduling)
Assignment 3 (Synchronization: The
Algorithmic Approach)
Assignment 4 (IPC Mechanisms - I
)
Assignment 5 (IPC Mechanisms - II
Projects ( Lab Projects)
TA's: sriram
yamu
pandit