Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles               Instructions
A | C | D | E | F | G | I | L | M | N | O | P | R | S | T
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 list presented here is sorted by departments, within departments alphabetically by the Course title. The departments are listed alphabetically by the Department code.

Courses


18101 Dept of Computer Science
Course code Course title Extent of teaching
Completion
Semester
Credits
Guarantor Instructors
NI-APT Advanced Program Testing 2P+1C Z,ZK Z 5 Donat-Bouillud P. Donat-Bouillud P.
NI-ATH AlgorithmicTheories of Games 2P+2C Z,ZK L 4 Valla T. Knop D., Valla T.
UNI-ADS Algorithms and data structures 2P+2C Z,ZK L 7
BI-AG1.21 Algorithms and Graphs 1 2P+2C Z,ZK Z 5 Knop D. Knop D., Opler M.
BIE-AG1.21 Algorithms and Graphs 1 2P+2C Z,ZK Z 5 Knop D. Valla T.
BIK-AG1.21 Algorithms and Graphs 1 14KP+4KC Z,ZK Z 5 Knop D. Hušek R.
BI-AG2.21 Algorithms and Graphs 2 2P+2C Z,ZK L 5 Suchý O. Valla T.
BIE-AG2.21 Algorithms and Graphs 2 2P+2C Z,ZK L 5 Suchý O. Hušek R.
BI-AVI.21 Algorithms visually 2P+1C Z,ZK L 4 Kučera L. Kučera L.
BI-AAG.21 Automata and Grammars 2P+2C Z,ZK Z 5 Holub J. Holub J., Janoušek J.
BIE-AAG.21 Automata and Grammars 2P+2C Z,ZK Z 5 Holub J. Holub J.
BIK-AAG.21 Automata and Grammars 14KP+4KC Z,ZK Z 5 Holub J. Plachý Š.
NI-GEN Code Generators 2P+1C Z,ZK Z 5 Janoušek J. Máj P.
NI-KTH Combinatorial Theories of Games 2P+1C Z,ZK L 4 Valla T. Valla T.
BI-CCN Compiler Construction 2P+1C Z,ZK L 5 Kirsch C. Kirsch C.
BIE-CCN Compiler Construction 2P+1C Z,ZK L 5 Kirsch C. Kirsch C.
NI-CPX Complexity Theory 3P+1C Z,ZK Z 5 Suchý O. Knop D., Suchý O.
NIE-CPX Complexity Theory 3P+1C Z,ZK Z 5 Knop D. Knop D., Suchý O.
QNI-CPX Complexity Theory 3P+1C Z,ZK Z 6 Knop D. Knop D., Suchý O.
UNI-SPP Continuous teaching practice 450XH KZ Z 15
NIE-KOD Data Compression 2P+1C Z,ZK L 5 Holub J. Holub J.
NI-KOD Data Compression 2P+1C Z,ZK L 5 Holub J. Holub J.
UNI-DI2 Didactics of Informatics II 1P+2C KZ L 7
UNI-DI1 Didactics of Informatics I 2P+2C Z,ZK L 6 Muzikář Z. Muzikář Z., Scholtzová J.
BI-EP1.24 Effective programming 1 2P+2C KZ Z 4 Kačer M. Kačer M.
NI-PAM Efficient Preprocessing and Parameterized Algorithms 2P+1C Z,ZK L 4 Suchý O. Suchý O.
BI-EP2 Efficient Programming 2 2P+2C KZ L 4 Kačer M. Kačer M.
NIE-EVY Efficient Text Pattern Matching 2P+1C Z,ZK Z 5 Holub J. Holub J.
NI-EVY Efficient Text Pattern Matching 2P+1C Z,ZK Z 5 Holub J. Holub J.
NI-VOL Elections 2P+1C Z,ZK L 5 Knop D. Knop D.
NI-FMT Finite model theory 2P+1C Z,ZK L 4 Jakl T. Jakl T.
NIE-GAK Graph theory and combinatorics 2P+2C Z,ZK L 5 Valla T. Opler M.
NI-GAK Graph theory and combinatorics 2P+2C Z,ZK L 5 Valla T. Opler M.
BIE-CSI Introduction to Computer Science 2C Z Z 2 Kirsch C. Kirsch C.
NI-DVG Introduction to Discrete and Computational Geometry 2P+1C Z,ZK L 5 Saumell Mendiola M. Saumell Mendiola M.
NIE-DVG Introduction to Discrete and Computational Geometry 2P+1C Z,ZK L 5 Saumell Mendiola M. Saumell Mendiola M.
NIE-LOM Linear Optimization and Methods 2P+0S+1C Z,ZK Z 5 Knop D. Knop D.
NI-LOM Linear Optimization and Methods 2P+1C Z,ZK Z 5 Knop D. Knop D.
QNI-LOM Linear Optimization and Methods 2P+1C Z,ZK Z 5 Knop D. Knop D.
NI-MPJ Modelling of Programming Languages 2P+1C Z,ZK Z 5
NIE-NON Nonlinear Continuous Optimization and Numerical Methods 2P+1C Z,ZK Z,L 5 Kruis J. Kruis J.
NI-NON Nonlinear Continuous Optimization and Numerical Methods 2P+1C Z,ZK Z,L 5 Kruis J. Kruis J.
BIE-OOP.21 Object-Oriented Programming 2P+2C Z,ZK Z 5 Křikava F. Křikava F., Máj P.
BIK-OOP.21 Object-Oriented Programming 14KP+4KC Z,ZK Z 5 Křikava F. Křikava F.
BI-OOP.21 Object-Oriented Programming 2P+2C Z,ZK Z 5 Křikava F. Křikava F., Máj P.
BI-ORL Operations Research and Linear Programming 1P+2C KZ L 5 Knop D. Knop D.
NIE-PAM Parameterized Algorithms 2P+1C Z,ZK L 4 Suchý O. Suchý O.
NIE-SYP Parsing and Compilers 2P+1C Z,ZK Z 5 Janoušek J. Janoušek J.
NI-SYP Parsing and Compilers 2P+1C Z,ZK Z 5 Janoušek J. Janoušek J.
NIE-ROZ Pattern Recognition 2P+1C Z,ZK Z 5 Haindl M. Haindl M.
NI-ROZ Pattern Recognition 2P+1C Z,ZK Z 5 Haindl M. Haindl M.
BIE-PA1.21 Programming and Algorithmics 1 2P+2R+2C Z,ZK Z 7 Trávníček J. Trávníček J.
BIK-PA1.21 Programming and Algorithmics 1 14KP+8KC Z,ZK Z 7 Trávníček J. Hušek R.
BI-PA1.21 Programming and Algorithmics 1 2P+2R+2C Z,ZK Z 7 Trávníček J. Balík M., Hušek R., Trávníček J., Vagner L., Vogel J.
BIE-PA2.21 Programming and Algorithmics 2 2P+1R+2C Z,ZK L 7 Trávníček J. Trávníček J.
BIK-PA2.21 Programming and Algorithmics 2 14KP+6KC Z,ZK L 7 Trávníček J. Hušek R., Kolomazníková B., Štorc O.
BI-PA2.21 Programming and Algorithmics 2 2P+1R+2C Z,ZK L 7 Trávníček J. Hušek R., Trávníček J., Vogel J.
BI-PMA Programming in Mathematica 2P+2C Z,ZK Z,L 4 Buk Z. Buk Z.
NI-PLS1 Programming Language Seminar 0P+1C Z Z 2 Donat-Bouillud P. Donat-Bouillud P., Křikava F.
NI-PLS2 Programming Language Seminar 0P+1C Z L 2
NI-PLS3 Programming Language Seminar 0P+1C Z Z 2
NI-PLS4 Programming Language Seminar 0P+1C Z L 2 Donat-Bouillud P. Donat-Bouillud P., Křikava F.
BIE-PJP.21 Programming Languages and Compilers 2P+1C Z,ZK L 5 Janoušek J. Janoušek J.
BI-PJP.21 Programming Languages and Compilers 2P+1C Z,ZK L 5 Janoušek J. Janoušek J.
QNI-PJK Programming languages for quantum computing 2P+1C Z,ZK 5 Janoušek J. Janoušek J.
BIE-PPA.21 Programming Paradigms 2P+2R Z,ZK Z 5 Janoušek J. Máj P.
BIE-PPA Programming Paradigms 2P+2C Z,ZK Z 5
BIK-PPA.21 Programming Paradigms 14KP+4KC Z,ZK Z 5 Janoušek J. Janoušek J.
BIK-PPA Programming Paradigms 14KP+4KC Z,ZK Z 5
BI-PPA.21 Programming Paradigms 2P+2R Z,ZK Z 5 Janoušek J. Janoušek J., Máj P.
BI-ACM Programming Practices 1 4C KZ L 5 Too many persons Valla T.
BI-ACM2 Programming Practices 2 4C KZ Z 5 Too many persons Suchý O., Valla T.
BI-ACM3 Programming Practices 3 4C KZ L 5 Too many persons Suchý O., Valla T.
BI-ACM4 Programming Practices 4 4C KZ Z 5 Too many persons Suchý O., Valla T.
UNI-PPP Propedeutics of pedagogical practice 2P+2C KZ L 6
UNI-RPP Reflection of teaching practice 26XH Z Z 3
NI-RUN Runtime Systems 2P+1C Z,ZK L 5 Křikava F. Křikava F.
BI-VAK.21 Selected Applications of Combinatorics 2R Z L 3 Opler M. Opler M.
BIE-VAK.21 Selected Combinatorics Applications 2R Z L 3 Opler M. Knop D., Opler M.
NI-APR Selected Methods for Program Analysis 2P+1C Z,ZK Z 5 Křikava F. Křikava F.
NI-SLA Sublinear algorithms 2P+1C Z,ZK Z 5 Knop D. Knop D.
BIE-SEG Systems Engineering 2C Z Z 0 Kirsch C. Kirsch C.
BI-TEX TeX and Typography 2P+1C Z,ZK L 4 Olšák P. Olšák P.
BI-TS1 Theoretical Seminar I 2C Z Z 4 Too many persons Knop D., Suchý O., Valla T.
BI-TS2 Theoretical Seminar II 2C Z L 4 Too many persons Suchý O., Valla T.
BI-TS3 Theoretical Seminar III 2C Z Z 4 Too many persons Suchý O., Valla T.
BI-TS4 Theoretical Seminar IV 2C Z L 4 Too many persons Suchý O., Valla T.
NI-TS3 Theoretical Seminar Master III 2C Z Z 4 Too many persons
NI-TS2 Theoretical Seminar Master II 2C Z L 4 Too many persons Suchý O., Valla T.
NI-TS1 Theoretical Seminar Master I 2C Z Z 4 Too many persons Knop D., Opler M., Suchý O., Valla T.
NI-TS4 Theoretical Seminar Master IV 2C Z L 4 Too many persons Suchý O., Valla T.


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