Course description

Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

BIE-OSY Operating Systems Extent of teaching: 2P+1R+1L

Instructor: Completion: Z,ZK

Department: 18104 Credits: 5 Semester: L

Annotation:
Students understand the classical theory of operating systems (OS) in addition to the knowledge gained in the BI-PS1 module. They get a solid knowledge of OS kernels, processes and threads implementations. They understand the problems of race conditions and principles and algorithms for critical sections, thread scheduling, resource allocation, deadlocks. They understand the techniques of managing virtual memory, principles and architectures of disks and disk arrays, file systems and peripheral devices. They gain basic knowledge necessary for developing system applications or for system administration. They are able to design and implement simple multithreaded applications.

Lecture syllabus:

1. Introduction. OS architecture and functions. OS kernel.

2. Processes and threads, management and implementation.

3. Race conditions. Critical section. Synchronization primitives.

4. Classical interprocess communication problems and their solutions.

5. Thread scheduling.

6. Resource allocation. Deadlock.

7. Memory management - basic methods.

8. Virtual memory. Paging. Segmentation.

9. Page replacement algorithms.

10. Physical disks and RAID.

11. File systems - properties.

12. File systems - implementation, examples (fat, ntfs, ufs, zfs).

Seminar syllabus:

1. Programs with multiple threads.

2. Thread synchronisation I. (mutex, condition variables).

3. Thread synchronisation II. (semaphores, barriers).

4. Processes (fork(), exec(),...).

5. Deadlock, physical and virtual memory.

6. Page replacement algorithms.

Literature:

1. Tanenbaum, A. S. ''Modern Operating Systems (2nd Edition)''. Prentice Hall, 2001. ISBN 0130313580.

2. Stallings, W. ''Operating Systems: Internals and Design Principles (5th Edition)''. Prentice Hall, 2004. ISBN 0131479547.

3. Silberschatz, A., Galvin, P. B., Gagne, G. ''Operating System Concepts (7th Edition)''. Wiley, 2004. ISBN 0471694665.

Requirements:
Common user-level knowledge of operating systems. Basic knowledge of C/C++ programming.

Information about the course and courseware are available at https://courses.fit.cvut.cz/BIE-OSY

The course is also part of the following Study plans:

Study Plan Study Branch/Specialization Role Recommended semester

BIE-BIT.2015 Computer Security and Information technology (Bachelor, in English) PP 4

BIE-TI.2015 Computer Science (Bachelor, in English) PP 4

BIE-WSI-SI.2015 Software Engineering (Bachelor, in English) PP 4

BIE-TI.2015_ORIGINAL Computer Science (Bachelor, in English) PP 2

Page updated 18. 4. 2024, semester: L/2020-1, L/2023-4, L/2019-20, Z/2021-2, L/2022-3, Z/2023-4, Z/2019-20, Z/2022-3, L/2021-2, Z/2024-5, Z/2020-1, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška

BIE-OSY	Operating Systems			Extent of teaching:	2P+1R+1L
Instructor:				Completion:	Z,ZK
Department:	18104	Credits:	5	Semester:	L

1.		Introduction. OS architecture and functions. OS kernel.
2.		Processes and threads, management and implementation.
3.		Race conditions. Critical section. Synchronization primitives.
4.		Classical interprocess communication problems and their solutions.
5.		Thread scheduling.
6.		Resource allocation. Deadlock.
7.		Memory management - basic methods.
8.		Virtual memory. Paging. Segmentation.
9.		Page replacement algorithms.
10.		Physical disks and RAID.
11.		File systems - properties.
12.		File systems - implementation, examples (fat, ntfs, ufs, zfs).

1.		Programs with multiple threads.
2.		Thread synchronisation I. (mutex, condition variables).
3.		Thread synchronisation II. (semaphores, barriers).
4.		Processes (fork(), exec(),...).
5.		Deadlock, physical and virtual memory.
6.		Page replacement algorithms.

1.		Tanenbaum, A. S. ''Modern Operating Systems (2nd Edition)''. Prentice Hall, 2001. ISBN 0130313580.
2.		Stallings, W. ''Operating Systems: Internals and Design Principles (5th Edition)''. Prentice Hall, 2004. ISBN 0131479547.
3.		Silberschatz, A., Galvin, P. B., Gagne, G. ''Operating System Concepts (7th Edition)''. Wiley, 2004. ISBN 0471694665.