|
Lecturer(s)
|
-
Večerka Arnošt, RNDr.
-
Trnečková Markéta, Mgr. Ph.D.
-
Zacpal Jiří, Mgr. Ph.D.
-
Kühr Tomáš, Mgr. Ph.D.
-
Osička Petr, Mgr. Ph.D.
-
Vyjídáček Roman, Mgr.
|
|
Course content
|
This course is the first in a two-part series. The goal of the course is to introduce students to the fundamentals of procedural programming, providing them with a foundation for further programming practice. Instruction is conducted independently of any specific development environment or compiler. Programming assignments are selected in relation to other courses within the field, ensuring that students can practically apply the theoretical knowledge acquired in other subjects. No prior knowledge of any programming language is assumed, only basic algorithmic problem-solving skills. Course Syllabus: - Structure of source code. - Data types, variables, and operators. - Program flow control: branching and iteration. - Functions. - Arrays. - User-defined data types. - Program debugging.
|
|
Learning activities and teaching methods
|
Demonstration
- Attendace
- 18 hours per semester
- Homework for Teaching
- 18 hours per semester
- Preparation for the Course Credit
- 4 hours per semester
|
|
Learning outcomes
|
The students become familiar with basic concepts of introduction to programming.
5. Synthesis Propose and construct programs in C.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Written exam, Student performance
Active participation in class. Completion of assigned homeworks. Passing the written exam.
|
|
Recommended literature
|
-
Brian Kernighan, Rob Pike. (1999). The practice of programming.
-
Brian W. Kernighan, Dennis M. Ritchie. (2008). Programovací jazyk C.
-
Jon Bodner. (2024). Learning Go: An Idiomatic Approach to Real-World Go Programming, 2nd Edition.
-
Pavel Tišnovský. (2025). Programovací jazyk Go.
-
SEDGEWICK, R. (2003). Algoritmy v C, části 1- 4: základy, datové struktury, třídění, vyhledávání. Praha.
|