Course detail

Operating Systems

FIT-IOSAcad. year: 2021/2022

The concept of an operating system (OS) as a part of software of a computer system. Architectures of operating systems, a classification of operating systems. An overview of the contemporary operating systems. The kernel of UNIX, its structure, graphical and textual interfaces, command languages. Process management, context switching, scheduling, interprocess communication. Memory management, paging, virtual memory. Synchronization of processes, semaphores and other synchronization means, deadlock, starvation.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

prof. Ing. Tomáš Vojnar, Ph.D.

Department

Department of Intelligent Systems (UITS)

Learning outcomes of the course unit

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.

Prerequisites

Basic knowledge of programming in C.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

  • Lectures.
  • Individual experiments.
  • Individual work on projects.

Assesment methods and criteria linked to learning outcomes

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

Course curriculum

  1. Introduction: basic notions of operating systems.
  2. The UNIX operating system.
  3. UNIX shell
  4. File systems,  input and output.
  5. Management of processes.
  6. Synchronization of concurrent tasks.
  7. Memory management.

Work placements

Not applicable.

Aims

The goal is to acquaint students with the principles of operating systems in general and with the basic concepts of the UNIX operating system.

Specification of controlled education, way of implementation and compensation for absences

  • 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.

Recommended optional programme components

  • Optional supplementary demonstration exercises provided they will be organised.

Prerequisites and corequisites

Basic literature

Silberschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts, 10. vydání, John Wiley & Sons, 2018. (CS)

Recommended reading

Not applicable.

eLearning

eLearning: currently opened course

Classification of course in study plans

  • Programme IT-BC-3 Bachelor's

    branch BIT , 1. year of study, summer semester, compulsory

  • Programme BIT Bachelor's, 1. year of study, summer semester, compulsory

Type of course unit

 

Lecture

39 hours, compulsory

Teacher / Lecturer

Ing. Ondřej Lengál, Ph.D.
Ing. Aleš Smrčka, Ph.D.
prof. Ing. Tomáš Vojnar, Ph.D.

Syllabus

  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.

Project

13 hours, compulsory

Teacher / Lecturer

Ing. Dominik Harmim
Ing. Radek Kočí, Ph.D.
Ing. David Kozák
Ing. Jiří Pavela
doc. Mgr. Adam Rogalewicz, Ph.D.
Ing. Aleš Smrčka, Ph.D.
Ing. Ondřej Vašíček
prof. Ing. Tomáš Vojnar, Ph.D.

Syllabus

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

eLearning

eLearning: currently opened course