1. write an multithreaded program and program which creates multiple processes
2. demonstrate how interrupt service routine works
3. apply synchronization mechanisms
4. list components of operating system kernel
5. analyze deterministic and non-deterministic task system behaviour
6. list and explain CPU scheduling algorithms
7. employ memory allocation mechanisms
8. explain demand paging
9. develop file-system functions

Twice a week.

Once a week.

Laboratory exercises are done independently as part of homework.

1. Operating system roles; Interfaces; Computer and operating system components; Design issues.
2. Device organization; I/O structure.
3. Interrupts.
4. Threads and processes; Thread management and context switching; Multiprocessor issues.
5. Mutual-exclusion.
6. Kernel.
7. Kernel; Synchronization and communication.
8. Semaphores and monitors; Midterm exam.
9. Semaphores and monitors.
10. Deterministic and stochastic task systems models.
11. Preemptive and non-preemptive scheduling; CPU scheduling.
12. Segmentation; Paging; Hierarchical organization and virtual memory.
13. Types of disks and data organization; File-system organization; File descriptor.
14. Typical file-system functions; Virtual file system; Memory-mapped files.
15. Types of virtualization; Hypervisors and cost of virtualization; Final exam.