English

Not applicable.

Student should be able to:
- describe operating system types,
- define kernel and system call,
- define process and thread,
- explain process scheduling,
- compare process synchronization methods,
- define process deadlock,
- describe memory management,
- explain virtual memory,
- describe file systems,
- explain network communication as part of operating system,
- describe principle of network services,
- analyse attacks on operating systems,
- describe firewall and proxy server,
- secure network operating system.

Programming basics.

Not applicable.

The teaching methods include lectures, computer laboratories, and individual project. The course uses e-learning system Moodle.

50 points theory, 36 points practicals, 14 points project.

1. Introduction - history, assembly language, basic input-output
2. Architecture - kernel, modules, system calls
3. Architecture - binary interface, virtualization
4. Processes - data structure, threads, operational states
5. Processes - scheduling, synchronization
6. Processes - race condition, deadlock
7. Memory - static memory, virtual memory
8. Memory - paging, segmentation
9. Memory - allocation, page replacement algorithms
10. File systems - data blocks, metadata, journaling systems
11. File systems - virtual files, organization of files
12. Network subsystem - network implementation, sockets
13. Network subsystem - daemons, basic services, security

Not applicable.

The aim of the course is to provide core knowledge about the structure and principles of network operating systems.

The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.

Not applicable.

Not applicable.

Silberschatz, A., Galvin, P., Gagne, G. Silberschatz's Operating Systems Concepts. John Wiley, 2019. 10th edition, ISBN: 978-1-119-45586-8. (EN)
Tanenbaum, A., Bos, H. Modern Operating Systems. PEARSON, 2015. 4th edition, ISBN: 9780133591620. (EN)

Not applicable.