|
Lecturer(s)
|
-
Trnečková Markéta, Mgr. Ph.D.
-
Zacpal Jiří, Mgr. Ph.D.
-
Osička Petr, Mgr. Ph.D.
-
Večerka Arnošt, RNDr.
-
Laštovička Jan, Mgr. Ph.D.
-
Vyjídáček Roman, Mgr.
|
|
Course content
|
The goal of the course is to introduce students to advanced topics in procedural programming, providing them with a solid foundation for further programming practice. 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. Course Syllabus: - Pointers and Memory. - Generics and Containers. - Reflection. - Interfaces. - File Handling and Parsing Basics. - Libraries and Packages.
|
|
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 advanced concepts of introduction to programming.
5. Synthesis Propose and construct programs in C.
|
|
Prerequisites
|
KMI/ZP1 Introduction to Programming 1
|
|
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.
-
Herout P. (2009). Učebnice jazyka C, 1. díl. Kopp.
-
Jeri R. Hanly, Elliot B. Koffman. (2006). Problem Solving and Program Design in C.
-
Jon Bodner. (2024). Learning Go: An Idiomatic Approach to Real-World Go Programming, 2nd Edition.
-
Koenig A. (1989). C Traps and Pitfalls.. Addison.
-
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.
|