Understand and explain the mechanisms of system processes
Understand concurrency
Learn process scheduling methods.
Mode of Delivery
E-Learning
Prerequisites
No
Recommended Optional Programme Components
None
Course Description
Basic modes of operating system, its mechanisms and structure. Processes and resources. Models. Threads. Inter-process communication. Mutual exclusion and synchronization. Concurrency models. Semaphores and monitors. Classical IPC problems. Deadlocks, its detection and recovery, the Banker's algorithm. CPU scheduling. Preemptive and non-preemptive strategies. Memory management. Swapping. Virtual memory, page table and paging algorithms.
Course Contents
WEEK
TOPICS
1st Week
Computer Architecture Overview
2nd Week
Basic modes of operating system, its mechanisms and structure
3rd Week
Process Structure and fundamental components
4th Week
Threads
5th Week
Concurrency: Introduction, Mutual Exclusion and Synchronization
Concurrency: Deadlock and strategies dealing with it
9th Week
Concurrency: Starvation and Dining Philosophers Problem
10th Week
Memory Management: Partitioning
11th Week
Memory Management: Paging, Segmentation
12th Week
Virtual Memory: OS software policies
13th Week
Process Scheduling: Types, Algorithms
14th Week
Final Exam
Recommended or Required Reading
1. Andrew S. Tanenbaum. Modern Operating Systems, 2/E, Prentice-Hall, 2001.
2. William Stallings. Operating Systems. Internals and Design Principles, 4/E, Prentice-Hall, 2001.
Planned Learning Activities and Teaching Methods
Lecture
Assessment Methods and Criteria
Quantity
Percentage (%)
Assignment
1
20
Total(%)
20
Contribution of In-term Studies to Overall Grade(%)
20
Contribution of Final Examination to Overall Grade(%)
