The goal of this course is to introduce the design principles and implementation of modern operating systems. The course covers the fundamental concepts of operating systems, including process management, memory management, file systems, and I/O management, and explains how these components are designed and implemented in contemporary operating systems. In addition to the theoretical foundations, the course includes a series of comprehensive programming assignments and laboratory exercises designed to develop practical system programming skills in UNIX-like operating systems, such as GNU/Linux.

If you have already taken the class on "Data structure and Algorithms" and have some experience with C and C++, it will be much easy to understand the class subject.

Week 1: Introduction / What is OS
Week 2: From Program to Process / Limited Direct Execution
Week 3: Process Scheduling / Proportional Share Scheduling
Week 4: Concurrency / Lock
Week 5: Semaphore / Deadlock
Week 6: Multi-CPU Scheduling
Week 7: Virtual Memory
Week 8: Midterm
Week 9: Address Translation / Segmentation / Free-space Management
Week 10: Paging / Paging – TLB / Paging – Smaller Table
Week 11: Swapping – Mechanism / Swapping – Policy
Week 12: I/O Devices / HDDs and RAID
Week 13: Flash-based SSDs / File and Directory
Week 14: File-system Implementation / Fast File System
Week 15: FSCK and Journaling / LFS
Week 16: Final

(Note that this schedule is tentative)

Offline lectures

Academic integrity
- no cheating allowed for homeworks and projects (copy or copied)