Operating Systems

• 39 hrs lectures
• 13 hrs projects

• 60 pts final exam
• 10 pts mid-term test
• 30 pts projects

The goal is to acquaint students with the principles of operating systems in general and with the basic concepts of the UNIX operating system.
Students are acquainted with the basic principles of operating systems (with emphasis on the UNIX operating system) and they understand the influence of operating systems upon the operation of complex computing systems. Students are able to exploit scripts for solving various tasks in a UNIX-based environment.

• Introduction to Programming Systems (IZP)
• Introduction to Software Engineering (IUS)

Basic knowledge of programming in C.

1. Introduction. Evolution of computers and operating systems (OS). Requirements on OS, classification of OS, standards. The basic terminology and the general structure of OS.
2. The UNIX operating system. The history and the most important development branches. The basic principles and structure of UNIX. The structure of the UNIX kernel, its interface and the different forms of communication with the kernel.
3. UNIX shell. Basic commands, programs, scripts. Special symbols. Input/output redirection, pipes, background processes, sub-shell. Variables, control structures.
4. A basic introduction to programming in UNIX. Languages, compilers, principles of linking programs, dynamically linked libraries. Standard utilities of UNIX.
5. File systems. The physical and logical structure of disks. Types of files, i-nodes, storing files on a disk.
6. Access rights to files in UNIX, users and groups, the suid and sgid attributes, the typical structure of directories in a UNIX system.
7. Input and output. The corresponding kernel services. Data structures and algorithms used by the input/output subsystem of the kernel.
8. Management of processes. The notion of a process, its states, and representation in the system. Loading the system, the init process. The fork, exec, exit, and wait calls.
9. Basic algorithms of process scheduling.
10. Mutual exclusion, semaphores and other synchronization means.
11. Typical synchronization tasks. Deadlocks and dealing with them.
12. Memory management. Address spaces, address translation, memory pages.
13. Virtual memory.

1. Creating scripts by means of the UNIX shell and the standard utilities of UNIX.
2. Process synchronization in UNIX using the C language.

• Evaluation of two home assignments individually solved by the students (max 30 points).
• Evaluation of a mid-term exam (max 10 points).

• Two individual home assignments, a half-semester test, a combined final exam (a compulsory written part, an oral part in border cases).
• The minimal number of points that must be obtained from the final exam is 27. Otherwise, no points will be assigned to a student.

• Primary contact by email by means of which individual consultations with lecturers and people responsible for exercises (assigned to groups of students during the semester) can be arranged.
• Possibility of discussing through web forums of the course (established during the semester).