Course details

Introduction to Programming Systems

IZP Acad. year 2023/2024 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

Course coordinator

Language of instruction

Czech, English

Completion

Credit+Examination (written)

Time span

  • 39 hrs lectures
  • 12 hrs seminar
  • 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

Lecturer

Instructor

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.


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.

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.

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 seminars

Seminar:

  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 projects - 24 points.
  • Computer practices - 10 points.
  • Mid-term written examination - 12 points.
  • Final written examination - 54 points.

 

 

  • 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., 5., 7., 8., 9., 11., 12., 13. of lectures E104 E105 E112 10:0011:50320 1BIB 2BIA 2BIB xx 30 - 49 Kreslíková
Mon lecture 6., 10. of lectures E104 E105 E112 10:0011:50320 1BIB 2BIA 2BIB xx 30 - 49 Smrčka
Mon lecture 2023-09-18 E104 E105 E112 10:0011:50320 1BIB 2BIA 2BIB xx 30 - 49 Kreslíková, Smrčka
Mon exam 2024-01-22 E112 13:0015:50 1. opravný termín
Mon lecture 1., 6., 10. of lectures E104 E105 E112 14:0014:50320 1BIB 2BIA 2BIB xx 30 - 49 Smrčka
Mon lecture 2., 3., 4., 5., 7., 8., 9., 11., 12., 13. of lectures E104 E105 E112 14:0014:50320 1BIB 2BIA 2BIB xx 30 - 49 Kreslíková
Mon seminar 1., 2., 3., 4., 5., 6., 7., 8., 9., 10., 11., 13. of lectures E104 E105 E112 15:0015:50320 1BIB 2BIA 2BIB xx 30 - 49 Smrčka
Mon other *) 2023-12-04 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Očenášek tpl 11, obhajoba projektu
Mon other *) 2023-12-04 N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 12, obhajoba projektu
Mon comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Očenášek tpl 11
Mon comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 12
Mon other *) 2023-12-04 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Očenášek tpl 14, obhajoba projektu
Mon other *) 2023-12-04 N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 15, obhajoba projektu
Mon comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Očenášek tpl 14
Mon comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 15
Tue other *) 2023-12-05 N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Veigend tpl 16, obhajoba projektu
Tue other *) 2023-12-05 N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Rozsíval tpl 17, obhajoba projektu
Tue other *) 2023-12-05 N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 18, obhajoba projektu
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Veigend tpl 16
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Rozsíval tpl 17
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 18
Tue lecture 2., 3., 4., 5., 6., 7., 8., 9., 10., 11., 12., 13. of lectures D0206 D105 10:0011:50502 1BIA 2BIA 2BIB xx 10 - 29 Smrčka
Tue lecture 2023-09-19 D0206 D105 10:0011:50502 1BIA 2BIA 2BIB xx 10 - 29 Kreslíková, Smrčka
Tue other *) 2023-12-05 N103 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Veigend tpl 19, obhajoba projektu
Tue other *) 2023-12-05 N104 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Rozsíval tpl 20, obhajoba projektu
Tue other *) 2023-12-05 N105 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 21, obhajoba projektu
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Veigend tpl 19
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Rozsíval tpl 20
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 10:0011:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 21
Tue other *) 2023-12-05 N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Hranický tpl 22, obhajoba projektu
Tue other *) 2023-12-05 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 23, obhajoba projektu
Tue other *) 2023-12-05 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Rozman tpl 24, obhajoba projektu
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Hranický tpl 22
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 23
Tue comp.lab 1., 3., 5., 6., 7., 8., 10., 11., 13. of lectures N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Rozman tpl 24
Tue comp.lab 2023-10-10 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Rozsíval tpl 24
Tue other *) 2023-12-05 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Hranický tpl 25, obhajoba projektu
Tue other *) 2023-12-05 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 26, obhajoba projektu
Tue other *) 2023-12-05 N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 27, obhajoba projektu
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Hranický tpl 25
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 26
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 27
Tue other *) 2023-12-05 N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Lazúr tpl 28, obhajoba projektu
Tue other *) 2023-12-05 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 29, obhajoba projektu
Tue other *) 2023-12-05 N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 30, obhajoba projektu
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Lazúr tpl 28
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 29
Tue comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 30
Wed exam 2024-01-10 A112 A113 C228 D0206 D0207 D105 E104 E105 E112 G202 09:0011:50 Řádný termín
Wed exam 2024-01-31 D0207 10:0012:50 2. opravný termín
Wed other *) 2023-12-06 N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Koutenský tpl 31, obhajoba projektu
Wed other *) 2023-12-06 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 32, obhajoba projektu
Wed other *) 2023-12-06 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Rozman tpl 33, obhajoba projektu
Wed comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 32
Wed comp.lab 1., 3., 4., 5., 6., 8., 10., 11., 13. of lectures N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Koutenský tpl 31
Wed comp.lab 1., 3., 4., 5., 6., 8., 10., 11., 13. of lectures N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Rozman tpl 33
Wed comp.lab 2023-11-01 N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Dolejška tpl 31
Wed comp.lab 2023-11-01 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Veigend tpl 33
Wed lecture lectures D0206 D105 16:0016:50502 1BIA 2BIA 2BIB xx 10 - 29 Smrčka
Wed other *) 2023-12-06 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx John tpl 34, obhajoba projektu
Wed other *) 2023-12-06 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 35, obhajoba projektu
Wed comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx John tpl 34
Wed comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Zavřel tpl 35
Wed seminar 1., 2., 3., 4., 5., 6., 7., 8., 9., 10., 11., 13. of lectures D0206 D105 17:0017:50502 1BIA 2BIA 2BIB xx 10 - 29 Smrčka
Wed other *) 2023-12-06 N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx John tpl 37, obhajoba projektu
Wed other *) 2023-12-06 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Lazúr tpl 38, obhajoba projektu
Wed other *) 2023-12-06 N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 39, obhajoba projektu
Wed comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx John tpl 37
Wed comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Lazúr tpl 38
Wed comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 39
Thu other *) 2023-12-07 N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 40, obhajoba projektu
Thu other *) 2023-12-07 N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Škarvada tpl 41, obhajoba projektu
Thu other *) 2023-12-07 N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 42, obhajoba projektu
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Vašíček tpl 40
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Škarvada tpl 41
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 42
Thu other *) 2023-12-07 N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 43, obhajoba projektu
Thu other *) 2023-12-07 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 44, obhajoba projektu
Thu other *) 2023-12-07 N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Škarvada tpl 45, obhajoba projektu
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Škarvada tpl 45
Thu comp.lab 1., 3., 5., 7., 8., 10., 11., 13. of lectures N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 44
Thu comp.lab 1., 5., 6., 7., 8., 10., 11., 13. of lectures N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 43
Thu comp.lab 3., 4. of lectures N103 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 43
Thu comp.lab 2023-10-12 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Vašíček tpl 44
Thu comp.lab 2023-10-26 N104 14:0015:5020 1BIA 1BIB 2BIA 2BIB xx Lazúr tpl 44
Thu other *) 2023-12-07 N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 46, obhajoba projektu
Thu other *) 2023-12-07 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 47, obhajoba projektu
Thu other *) 2023-12-07 N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 48, obhajoba projektu
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 46
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Husa tpl 48
Thu comp.lab 1., 3., 5., 7., 8., 10., 11., 13. of lectures N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Kozák tpl 47
Thu comp.lab 2023-10-12 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Vašíček tpl 47
Thu comp.lab 2023-10-26 N104 16:0017:5020 1BIA 1BIB 2BIA 2BIB xx Lazúr tpl 47
Thu other *) 2023-12-07 N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 49, obhajoba projektu
Thu other *) 2023-12-07 N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Škarvada tpl 50, obhajoba projektu
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 49
Thu comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N104 18:0019:5020 1BIA 1BIB 2BIA 2BIB xx Škarvada tpl 50
Fri other *) 2023-12-08 N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 52
Fri other *) 2023-12-08 N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Veigend tpl 54
Fri comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N103 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Grézl tpl 52
Fri comp.lab 1., 3., 4., 5., 6., 7., 8., 10., 11., 13. of lectures N105 08:0009:5020 1BIA 1BIB 2BIA 2BIB xx Vašíček tpl 54
Fri exam 2023-11-10 A112 A113 C228 D0206 D0207 D105 G202 18:0020:00 Půlsemestrální test
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