Course detail

Introduction to Programming Systems

FIT-IZPAcad. year: 2025/2026

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).

Language of instruction

Czech

Number of ECTS credits

7

Mode of study

Not applicable.

Guarantor

Ing. Aleš Smrčka, Ph.D.

Department

Department of Intelligent Systems (UITS)

Entry knowledge

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.

Rules for evaluation and completion of the course

  • Computer exercises: A student can earn 10 points during the semester. Typically, a student can earn 1 point for active participation in each of the 10 exercises. The form and conditions for making up missed classes will be determined by the instructor.
  • Project work: 2 projects are to be handed in during the course at the specified times, for which a total of 24 points may be obtained. The project assignments will be available at least 2 weeks before the submission deadline.
  • Midterm written examination: A written test will be given during the semester for which the student may earn 12 points. The midterm test does not have an alternate date.
  • Credit: In order to receive credit for entering the final exam, a student must earn at least 23 points in the sum of the practicals, projects, and the midterm test. The student must also earn at least 6 points for the computer exercises and 1 point for each project submitted. If fraudulent behaviour (forbidden collaboration on a project or plagiarism) is detected, a credit will not be awarded, and disciplinary action will be considered.
  • Final written examination: The written examination with one regular and two make-up dates is graded with 54 points. To receive points on the exam, it must be scored at a minimum of 23 points. Otherwise, the exam will be scored 0 points.

Aims

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.

Study aids

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5. 
Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937. 
Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
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. 
The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
Virius, M.: Jazyky C a C++, Grada Publishing, 2011, ISBN 978-80-247-3917-5.
Wirth, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988. 

Recommended reading

BS ISO/IEC 9899:2011, Information technology. Programming languages. C, 2012, ISBN 978 0 580 80165 5.
Cormen, T.: Introduction to Algorithms, The MIT Press, 2001, ISBN 0262032937.
Harbison, P.: C: A Reference Manual (5th Edition), Prentice Hall, 2002, ISBN 013089592X.
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.
Kernighan, B., W., Ritchie, D., M.: Programovací jazyk C, Computer Press, Brno, 2006, ISBN 80-251-0897-X.
McConnell, S.: Code Complete, Microsoft Press, 2004, ISBN 0735619670.
Schildt, H.: Nauč se sám C, SoftPress s.r.o, Praha, 2001, ISBN 80-86497-16-X.
Schildt, H.: Teach Yourself C, McGraw-Hill Companies, 2001.
Soubor materiálů prezentovaných na přednáškách je dostupný na WWW.
Teaching materials available on WWW.
The C Standard : Incorporating Technical Corrigendum 1, by Standards Institute British, John Wiley & Sons, 2002, ISBN 0470845732.
Virius, M.: Jazyky C a C++, Grada Publishing, 2011, ISBN 978-80-247-3917-5.
Wirth, N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988.

Classification of course in study plans

  • Programme BAK-MIn Bachelor's 2 year of study, winter semester, elective
  • Programme BPC-AMT Bachelor's 0 year of study, winter semester, elective

  • Programme BPC-AUD Bachelor's

    specialization AUDB-ZVUK , 0 year of study, winter semester, elective
    specialization AUDB-TECH , 0 year of study, winter semester, elective

  • Programme BPC-ECT Bachelor's 0 year of study, winter semester, elective
  • Programme BPC-IBE Bachelor's 0 year of study, winter semester, elective
  • Programme BPC-MET Bachelor's 0 year of study, winter semester, elective
  • Programme BPC-SEE Bachelor's 0 year of study, winter semester, elective
  • Programme BPC-TLI Bachelor's 0 year of study, winter semester, elective
  • Programme BPC-NCP Bachelor's 0 year of study, winter semester, elective
  • Programme BIT Bachelor's 1 year of study, winter semester, compulsory
  • Programme BIT Bachelor's 1 year of study, winter semester, compulsory

Type of course unit

 

Lecture

39 hod., optionally

Teacher / Lecturer

Ing. Kamil Jeřábek, Ph.D.
Ing. Aleš Smrčka, Ph.D.
Ing. Libor Polčák, Ph.D.

Syllabus

  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.

Seminar

12 hod., optionally

Teacher / Lecturer

Ing. Aleš Smrčka, Ph.D.

Syllabus

  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.

Exercise in computer lab

20 hod., compulsory

Teacher / Lecturer

Ing. Radek Hranický, Ph.D.
Ing. Michal Rozsíval
Ing. Jaroslav Rozman, Ph.D.
Ing. David Kozák
Ing. Daniel Dolejška
Ing. Petr Veigend, Ph.D.
Ing. Petr John
Ing. Michal Koutenský
Ing. Ondřej Vašíček
Ing. Jan Zavřel
Ing. František Grézl, Ph.D.
Ing. Juraj Lazúr
RNDr. Libor Škarvada
Ing. Jakub Husa, Ph.D.
Ing. Jan Klhůfek

Syllabus

  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

Project

7 hod., compulsory

Teacher / Lecturer

Ing. Jan Zavřel
Ing. Juraj Lazúr
Ing. Jaroslav Rozman, Ph.D.
Ing. Jan Klhůfek
Ing. Daniel Dolejška
Ing. Radek Hranický, Ph.D.
Ing. Michal Rozsíval
Ing. David Kozák
Ing. Michal Koutenský
Ing. Petr John
RNDr. Libor Škarvada
Ing. Jakub Husa, Ph.D.
Ing. Ondřej Vašíček
Ing. František Grézl, Ph.D.
Ing. Petr Veigend, Ph.D.

Syllabus

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