Introduction. Historical facts. Single and multitasking computing systems, single and multiuser systems. Interactive systems. Basic computer architecture facts. Interrupt handling. Functions of an operating systems. The process concept. Process handling. Process scheduling algorithms. Asynchronous concurrent processes. Dekker’s algorithm. Semaphors, monitors. Problems on mutual exclusion. Deadlocks, Banker’s algorithm. Memory management. Secondary memory and disk scheduling algorithms. Main memory. Program allocation techniques, contiguous/non-contiguous allocation. Virtual memory. Non-contiguous memory allocation, paging and segmentation. Virtual memory management. Table lookaside buffer. Page replacement techniques. The working set.

Case study: the Linux system and laboratory practice on the concepts developed in class.