Course: Programming

« Back
Course title Programming
Course code MTI/PRG-L
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study not specified
Semester Summer
Number of ECTS credits 4
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements Course does not contain work placement
Recommended optional programme components None
  • Kraus Jan, Ing. Ph.D.
Course content
Lectures 1. Structure of program. Basic elements. 2. Declaration of variables, constants, types. 3. Basic data types. Real, integer, boolean, char types - constant values, operations, standard functions. Ordinal types. Expressions. 4. Programming language statements. 5. Procedures and functions. Parameters of procedures and functions. 6. Structure data types. Arrays. 7. Text strings. 8. Structure data types. Record, set. 9. Files. IO operation. Text files. 10. Binary file. 11. Sorting algorithms. 12. Recursion and its usage. 13. Structure of program memory. Pointers. Dynamic data structures and their realisation. 14. Basics of object oriented programming. Practice 1. Input/output operation - standard input and output. 2. Evaluation of real and integer expressions. 3. Decision algorithms. 4. Repeating, iterations. 5. Arrays. 6. Text strings. 7. Record. 8. Matrix algorithms. 9. Array sorting. 10. Text files. 11. Binary files. 12. Recursive algorithms. 13. Dynamic memory allocation. 14. Class type.

Learning activities and teaching methods
Monological explanation (lecture, presentation,briefing), Working activities (workshops)
  • Class attendance - 56 hours per semester
Learning outcomes
The course is an introduction to the computer programming. Students learn methods of algorithm development. The programming language C# are used.
Students will acquire the basic concepts algorithm development and realization of algorithms in programming language Pascal or C.

Assessment methods and criteria
Practical demonstration of acquired skills

Participation on seminars. Realisation of requested tasks. Pass exam.
Recommended literature
  • Cormen, T. H. Introduction to algorithms. The MIT Press, Cambridge, Massachusetts, 2001.
  • Jinoch, J., Müller, K., Vogel, J. Programování v jazyku Pascal. SNTL, Praha, 1988.
  • Mikula, P. Borland Pascal 7.0, kompendium. Grada, Praha, 1996.
  • Satrapa, P. Pascal pro zelenáče. Neokortex, s.r.o., Praha, 2000.
  • Sedgewick, R. Algoritmy v C. SoftPress, 2003.
  • Schildt, H. Nauč se C, C++. SoftPress, Praha.
  • Wirth, N. Algoritmy a štruktúry údajov. Alfa, Bratislava, 1987.

Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Mechatronics, Informatics and Interdisciplinary Studies Study plan (Version): Informatics and Logistics (2015) Category: Informatics courses 1 Recommended year of study:1, Recommended semester: Summer