Course details

Introduction to Programming Systems

IZP Acad. year 2022/2023 Winter semester 7 credits

Basic programming construction of high programming language: variables, types, expressions, control structures, procedures and functions, parameter passing, input/output, exceptional state processing. Basic data structures: simple data types, structured data types: array, record, file, strings. Dynamic data structures, the concept of pointers. Strategy for selecting an appropriate data structure. Recursion, the concept of recursion. Global and local variables. Simple recursive functions (procedures). Modular Design and abstraction. Debugging, testing and documentation of the program. Concepts will be illustrated by using appropriate programming language. (ISO/IEC 9899:1999 Programming languages - C).

Guarantor

Kreslíková Jitka, doc. RNDr., CSc. (UIFS)

Course coordinator

Smrčka Aleš, Ing., Ph.D. (UITS)

Language of instruction

Czech, English

Completion

Credit+Examination (written)

Time span

  • 39 hrs lectures
  • 12 hrs exercises
  • 22 hrs pc labs
  • 5 hrs projects

Assessment points

  • 54 pts final exam (written part)
  • 12 pts mid-term test (written part)
  • 10 pts numeric exercises
  • 24 pts projects

Department

Department of Information Systems (UIFS)

Lecturer

Kreslíková Jitka, doc. RNDr., CSc. (UIFS)
Smrčka Aleš, Ing., Ph.D. (UITS)

Instructor

Andriushchenko Roman, Ing. (UITS)
Dolejška Daniel, Ing. (UIFS)
Grézl František, Ing., Ph.D. (UPGM)
Harmim Dominik, Ing. (UITS)
Hranický Radek, Ing., Ph.D. (UIFS)
Hurta Martin, Ing. (UPSY)
Husa Jakub, Ing. (UPSY)
Chlebík Jakub, Ing. (UPSY)
John Petr, Ing. (UIFS)
Kozák David, Ing. (UITS)
Malík Viktor, Ing. (UITS)
Musil Miloš, Ing., Ph.D. (UIFS)
Očenášek Pavel, Mgr. Ing., Ph.D. (UIFS)
Rozman Jaroslav, Ing., Ph.D. (UITS)
Smrčka Aleš, Ing., Ph.D. (UITS)
Zavřel Jan, Ing. (UIFS)

Subject specific learning outcomes and competences

The student will learn how to write programs in high programming languages. The student will also acquire basic English terminology of programming,  The student will be acquainted with testing principles of programs. The student will learn how to document, to present, and to defend the reached results. The student will learn the computer-aided solving of simple problems by elaborating projects. The student will learn to create the program documentation and defend the results of project solving.

Learning objectives

Familiarize yourself with data organization when solving problems. Actively master basic algorithms and be able to apply them in practical problems. Familiarize yourself with the principles of program testing. Learn how to use program debugging tools. Learn to document, defend and present achieved results.

Why is the course taught

After taking the Introduction to Programming Systems, the student should be able to understand the basic notions, algorithms, and principles of high-level programming languages. A student will have a good skill of the programming and debugging in C language. The knowledge can be used in various areas of software development.

Prerequisite knowledge and skills

This course is placed in the winter term of the first year of the bachelor's study programme. Thus, we expect that students have the high school level knowledge of mathematics and using computers.

Technical equipment

volně dostupné

  • Code::Blocks

Study literature

  • McConnell, S.: Code Complete, Microsoft Press, 2004, ISBN 0735619670.
  • Kernighan, B., W., Ritchie, D., M.: Programovací jazyk C, Computer Press, Brno, 2006, ISBN 80-251-0897-X.
  • Schildt, H.: Nauč se sám C, SoftPress s.r.o, Praha, 2001, ISBN 80-86497-16-X.
  • Teaching materials available on WWW.
  • Herout, P.: Učebnice jazyka C, Kopp, České Budějovice, 2009, 6. vyd., ISBN 978-80-7232-383-8.
  • Soubor materiálů prezentovaných na přednáškách je dostupný na WWW.
  • BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5.
  • Virius, M.: Jazyky C a C++, Grada Publishing, 2011, ISBN 978-80-247-3917-5.
  • The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
  • Kadlec, V.: Učíme se programovat v jazyce C, Computer Press, Praha, 2005, ISBN 80-7226-715-9.
  • Wirth, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988.
  • Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937.
  • Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
  • Schildt, H.: Teach Yourself C, McGraw-Hill Companies, 2001.

Fundamental literature

  • BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5. 
  • Virius, M.: Jazyky C a C++, Grada Publishing, 2011, ISBN 978-80-247-3917-5.
  • Herout, P.: Učebnice jazyka C, Kopp, České Budějovice, 2009, 6. vyd., ISBN 978-80-7232-383-8.
  • Kadlec, V.: Učíme se programovat v jazyce C, Computer Press, Praha, 2005, ISBN 80-7226-715-9. 
  • Wirth, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988. 
  • The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
  • Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
  • Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937. 

Syllabus of lectures

  1. Introductory information on the organization of teaching. Versioning and working tools of the programmer.
  2. Principles of programming languages. Control structures of programming languages.
  3. Pointer type, field, function.
  4. Text files, standard input/output. Structured data types.
  5. Debugging programs.
  6. Recurrent problems, numerical calculations and algorithms.
  7. Vectors and matrices.
  8. Search and sort.
  9. Recursion in programming.
  10. Advanced program debugging, verification and validation, source code documentation.
  11. Dynamic data structures.
  12. Joint structures.
  13. Modular structure of the program.

Syllabus of numerical exercises

Demonstration lessons:

  1. Development tools.
  2. Basic field work, string, manual pages.
  3. Work with the field, functions.
  4. Standard input and output, read from/write to file.
  5. Debugging programs.
  6. Iterative calculations.
  7. Control loop, automaton.
  8. Dynamic memory allocation.
  9. Recursion.
  10. Advanced Debugging and Documentation.
  11. Dynamic structures.
  12. Modular structure of programs.

Syllabus of computer exercises

  1. First programs and basic constructions
  2. Cycle, first work with fields
  3. Strings
  4. Functions and nested loops
  5. Data structures
  6. Introduction to indicators
  7. Work with pointers
  8. Dynamic allocation, debugging techniques and tools
  9. Algorithmization, recursion
  10. Structured data types

Syllabus - others, projects and individual work of students

  1. Work with text.
  2. Working with data structures.

Progress assessment

  • Evaluated home assignments with the defence - 24 points.
  • Computer practices - 10 points.
  • Mid-term written examination - 12 points.
  • Final written examination - 54 points.

 

Teaching methods and criteria

Teaching is realized in the form of lectures, exercises and project solutions. Lectures have the character of an explanation of basic principles, methodology of the discipline, problems and their exemplary solutions. Exercises and project solutions support in particular the practical mastery of the material presented in lectures or assigned for independent study with the active participation of students.

Controlled instruction

  • Realisation and delivery of 2 home assignments.
  • Demonstration of home assignment during computer practises.
  • 10 computer practices.
  • Delivered and controlled the source code documentation of one project.
  • Mid-term written test.
  • Final written examination. The minimal number of points which can be obtained from the final exam is 23. Otherwise, no points will be assigned to a student.

Exam prerequisites

  • In order to receive a credit and thus to be admitted to the final exam, the student must obtain a total of at least 23 points (from projects, computer labs and from the half-semester test):
    • from projects, at least 1 point from each project,
    • at least 6 points from computer labs.
  • Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.

How to contact the teacher

Teachers have consultation hours.

Schedule

DayTypeWeeksRoomStartEndCapacityLect.grpGroupsInfo
Mon lecture 2., 3., 4., 6., 7., 8., 9., 11., 12., 13. of lectures E104 E105 E112 10:0011:50350 1BIB 2BIA 2BIB xx 30 - 49 Kreslíková
Mon lecture 5., 10. of lectures E104 E105 E112 10:0011:50350 1BIB 2BIA 2BIB xx 30 - 49 Smrčka
Mon lecture 2022-09-19 E104 E105 E112 10:0011:50350 1BIB 2BIA 2BIB xx 30 - 49 Kreslíková, Smrčka
Mon other *) 2022-12-05 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Andriushchenko Obhajoba projektu, topr 10, Andriushchenko
Mon other *) 2022-12-05 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Hurta Obhajoba projektu, topr 11, Hurta
Mon other *) 2022-12-05 N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, topr 12, Husa
Mon comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Andriushchenko tpl 10, Andriushchenko
Mon comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 12, Husa
Mon comp.lab 2., 3., 4., 5., 7., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Hurta tpl 11, Hurta
Mon comp.lab 2022-09-19 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 11, Hurta
Mon comp.lab 2022-11-07 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Andriushchenko tpl 11, Hurta
Mon lecture 1., 5., 10. of lectures E104 E105 E112 18:0018:50350 1BIB 2BIA 2BIB xx 30 - 49 Smrčka
Mon lecture 2., 3., 4., 6., 7., 8., 9., 11., 12., 13. of lectures E104 E105 E112 18:0018:50350 1BIB 2BIA 2BIB xx 30 - 49 Kreslíková
Mon other *) 2022-12-05 N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Andriushchenko Obhajoba projektu, topr 13, Andriushchenko
Mon other *) 2022-12-05 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Hurta Obhajoba projektu, topr 15, Hurta
Mon other *) 2022-12-05 N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, topr 14, Husa
Mon comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Andriushchenko tpl 13, Andriushchenko
Mon comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 14, Husa
Mon comp.lab 2., 3., 4., 5., 7., 10., 11., 13. of lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Hurta tpl 15, Hurta
Mon comp.lab 2022-09-19 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 15, Hurta
Mon comp.lab 2022-11-07 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Andriushchenko tpl 15, Hurta
Tue other *) 2022-12-06 N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 16, as. Grézl
Tue other *) 2022-12-06 N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Kozák Obhajoba projektu, topr 17, as. Kozák
Tue other *) 2022-12-06 N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel Obhajoba projektu, topr 18, as. Zavřel
Tue comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 16, as. Grézl
Tue comp.lab 1., 2., 3., 5., 7., 8., 10., 11., 13. of lectures N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 17, as. Kozák
Tue comp.lab 1., 3., 4., 5., 7., 8., 10., 13. of lectures N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 18, as. Zavřel
Tue comp.lab 2., 11. of lectures N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 18, as. Zavřel
Tue comp.lab 2022-10-11 N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Harmim tpl 17, as. Kozák
Tue lecture 2., 3., 4., 5., 6., 7., 8., 9., 10., 12., 13. of lectures D0206 D105 16:0017:50540 1BIA 2BIA 2BIB xx 10 - 29 Smrčka
Tue lecture 2022-09-20 D0206 D105 16:0017:50540 1BIA 2BIA 2BIB xx 10 - 29 Kreslíková, Smrčka
Tue lecture 2022-11-29 D0206 D105 16:0017:50540 1BIA 2BIA 2BIB xx 10 - 29 Kreslíková
Tue other *) 2022-12-06 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel Obhajoba projektu, topr 19, as. Zavřel
Tue other *) 2022-12-06 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Rozman Obhajoba projektu, topr 20, as. Rozman
Tue other *) 2022-12-06 N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, topr 21, as. Husa
Tue comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Rozman tpl 20, as. Rozman
Tue comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 21, as. Husa
Tue comp.lab 1., 4., 5., 7., 8., 10., 13. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 19, as. Zavřel
Tue comp.lab 2., 3., 11. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 19, as. Zavřel
Tue exercise 2022-09-27 E112 18:0018:50112 1BIA 1BIB xx 10 - 29 30 - 49 Smrčka Představení distribuce Fedora
Tue other *) 2022-12-06 N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Hranický Obhajoba projektu, topr 22, as. Hranický
Tue other *) 2022-12-06 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Obhajoba projektu, topr 23, volné využití
Tue other *) 2022-12-06 N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, topr 24, as. Husa
Tue comp.lab *) lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx tpl 23, volné využití
Tue comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 24, as. Husa
Tue comp.lab 1., 2., 3., 4., 5., 7., 8., 11., 13. of lectures N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Hranický tpl 22, as. Hranický
Tue comp.lab 2022-11-22 N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 22, as. Hranický
Wed exam 2023-01-11 A112 A113 D0206 D0207 D105 E104 E105 E112 11:0014:00Řádný termín
Wed exam 2023-02-01 E104 E112 11:0014:002. opravný termín
Wed exercise 1., 3., 4., 5., 6., 7., 8., 9., 10., 12., 13. of lectures D105 11:0011:50350 1BIB 2BIA 2BIB xx 30 - 49 Smrčka
Wed other *) 2022-12-07 N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 25, as. Grézl
Wed other *) 2022-12-07 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška Obhajoba projektu, topr 26, as. Dolejška
Wed other *) 2022-12-07 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Rozman Obhajoba projektu, topr 27, as. Rozman
Wed comp.lab 1., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 25, as. Grézl
Wed comp.lab 1., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Rozman tpl 27, as. Rozman
Wed comp.lab 3., 4., 5., 7., 8., 10., 11., 13. of lectures N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 26, as. Dolejška
Wed comp.lab 2022-09-21 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 26, as. Dolejška
Wed other *) 2022-12-07 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx John Obhajoba projektu, topr 28, as. John
Wed other *) 2022-12-07 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška Obhajoba projektu, topr 29, as. Dolejška
Wed other *) 2022-12-07 N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, topr 30, as. Husa
Wed comp.lab 1., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 30, as. Husa
Wed comp.lab 1., 3., 4., 5., 8., 10., 11., 13. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx John tpl 28, as. John
Wed comp.lab 3., 4., 5., 7., 8., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 29, as. Dolejška
Wed comp.lab 2022-09-21 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 29, as. Dolejška
Wed comp.lab 2022-11-02 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Chlebík tpl 28, as. John
Wed other *) 2022-12-07 N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx John Obhajoba projektu, topr 31, as. John
Wed other *) 2022-12-07 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Kozák Obhajoba projektu, topr 32, as. Kozák
Wed other *) 2022-12-07 N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, topr 33, as. Husa
Wed comp.lab 1., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx John tpl 31, as. John
Wed comp.lab 1., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 33, as. Husa
Wed comp.lab 1., 3., 5., 7., 8., 10., 11., 13. of lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 32, as. Kozák
Wed comp.lab 2022-10-12 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Hranický tpl 32, as. Kozák
Thu other *) 2022-12-08 N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 34, as. Grézl
Thu other *) 2022-12-08 N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška Obhajoba projektu, topr 35, as. Dolejška
Thu other *) 2022-12-08 N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Musil Obhajoba projektu, topr 36, as. Musil
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 34, as. Grézl
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Musil tpl 36, as. Musil
Thu comp.lab 3., 4., 5., 7., 8., 10., 11., 13. of lectures N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 35, as. Dolejška
Thu comp.lab 2022-09-22 N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 35, as. Dolejška
Thu comp.lab 2022-09-29 N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Hurta tpl 35, as. Dolejška
Thu other *) 2022-12-08 N103 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 37, as. Grézl
Thu other *) 2022-12-08 N104 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška Obhajoba projektu, topr 38, as. Dolejška
Thu other *) 2022-12-08 N105 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Musil Obhajoba projektu, topr 39, as. Musil
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 37, as. Grézl
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Musil tpl 39, as. Musil
Thu comp.lab 3., 4., 5., 7., 8., 10., 11., 13. of lectures N104 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 38, as. Dolejška
Thu comp.lab 2022-09-22 N104 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 38, as. Dolejška
Thu comp.lab 2022-09-29 N104 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Hurta tpl 38, as. Dolejška
Thu lecture 1., 2., 3., 4., 5., 6., 7., 8., 10., 12. of lectures D0206 D105 11:0011:50540 1BIA 2BIA 2BIB xx 10 - 29 Smrčka
Thu lecture 2022-12-01 D0206 D105 11:0011:50540 1BIA 2BIA 2BIB xx 10 - 29 Kreslíková
Thu exercise 1., 2., 3., 4., 5., 6., 7., 8., 10., 12. of lectures D0206 D105 12:0012:50540 1BIA 2BIA 2BIB xx 10 - 29 Smrčka
Thu other *) 2022-12-08 N103 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Očenášek Obhajoba projektu, topr 40, as. Očenášek
Thu other *) 2022-12-08 N104 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Malík Obhajoba projektu, topr 41, as. Malík
Thu other *) 2022-12-08 N105 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Musil Obhajoba projektu, topr 42, as. Musil
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N104 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Malík tpl 41, as. Malík
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N105 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Musil tpl 42, as. Musil
Thu comp.lab 1., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Očenášek tpl 40, as. Očenášek
Thu comp.lab 2022-09-29 N103 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Chlebík tpl 40, as. Očenášek
Thu other *) 2022-12-08 N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 43, as. Grézl
Thu other *) 2022-12-08 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Malík Obhajoba projektu, topr 44, as. Malík
Thu other *) 2022-12-08 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Chlebík Obhajoba projektu, topr 45, as. Chlebík
Thu comp.lab *) 1., 2., 3., 4., 5., 6., 7., 8., 10., 11., 12., 13. of lectures N203 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx tpl 57, volné využití
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 43, as. Grézl
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Malík tpl 44, as. Malík
Thu comp.lab 1., 2., 3., 4., 7., 8., 10., 11., 13. of lectures N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Chlebík tpl 45, as. Chlebík
Thu comp.lab 2022-10-20 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Očenášek tpl 45, as. Chlebík
Thu other *) 2022-12-08 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 46, as. Grézl
Thu other *) 2022-12-08 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Chlebík Obhajoba projektu, topr 47, as. Chlebík
Thu other *) 2022-12-08 N203 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, tpl 48, as. Husa
Thu comp.lab *) 1., 2., 3., 4., 5., 6., 7., 8., 10., 11., 12., 13. of lectures N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx tpl 58, volné využití
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 46, as. Grézl
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N203 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 48, as. Husa
Thu comp.lab 1., 2., 3., 4., 7., 8., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Chlebík tpl 47, as. Chlebík
Thu comp.lab 2022-10-20 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx John tpl 47, as. Chlebík
Thu other *) 2022-12-08 N203 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa Obhajoba projektu, topr 51, as. Husa
Thu comp.lab *) 1., 2., 3., 4., 5., 6., 7., 8., 10., 11., 12., 13. of lectures N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx tpl 49, volné využití
Thu comp.lab *) 1., 2., 3., 4., 5., 6., 7., 8., 10., 11., 12., 13. of lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx tpl 50, volné využití
Thu comp.lab *) 1., 2., 3., 4., 5., 6., 7., 8., 10., 11., 12., 13. of lectures N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx tpl 59, volné využití
Thu comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N203 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 51, as. Husa
Fri comp.lab *) 1., 2., 3., 4., 5., 7., 8., 9., 10., 11., 12., 13. of lectures N203 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx tpl 52, volné využití
Fri comp.lab *) 1., 2., 3., 4., 5., 7., 8., 9., 10., 11., 12., 13. of lectures N204 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx tpl 53, volné využití
Fri other *) 2022-12-09 N204 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 55, as. Grézl
Fri comp.lab *) 1., 2., 3., 4., 5., 7., 8., 9., 10., 11., 12., 13. of lectures N203 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx tpl 54, volné využití
Fri comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N204 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 55, as. Grézl
Fri other *) 2022-12-09 N204 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Grézl Obhajoba projektu, topr 56, as. Grézl
Fri comp.lab 1., 2., 3., 4., 5., 7., 8., 10., 11., 13. of lectures N204 12:0013:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 56, as. Grézl
Fri exam 2023-01-20 E112 15:0018:001. opravný termín
It is not possible to register this class in Studis. (Some exercises may be opened later if needed, but this is not guaranteed.)

Course inclusion in study plans

  • Programme BIT, 1st year of study, Compulsory
  • Programme BIT (in English), 1st year of study, Compulsory
  • Programme IT-BC-3, field BIT, 1st year of study, Compulsory
Back to top