|
Lecturer(s)
|
-
Večerka Arnošt, RNDr.
-
Kühr Tomáš, Mgr. Ph.D.
-
Trnečková Markéta, Mgr. Ph.D.
-
Zacpal Jiří, Mgr. Ph.D.
-
Osička Petr, Mgr. Ph.D.
-
Kauer Martin, Mgr.
-
Vyjídáček Roman, Mgr.
|
|
Course content
|
This course is the first one in the Introduction to Programming series. It is targeted at getting fundamental knowledge of the procedural programming paradigm and acquiring the ability to solve elementary programming tasks. We use the C language to explain the procedural paradigm and to pass the programming ability. Therefore, the syntax and the semantics of the C language is taught in this course. In the first part of each lesson, syntax and semantics of the C language is presented. In the second part, students use the acquired knowledge to solve practical problems. There are lots of variants of the C language, the students are therefore led to use the ANSI standard version. Practical problems are chosen to train general programming skills as well as to practice theoretical knowledge gained in other branches. Curriculum: - Program source code structure. - Data types, variables, constants. - Operators. - Compound commands, conditions, loops. - Arrays, structured and enumeration type. - Functions. - Basic input and output.
|
|
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 W. Kernighan, Dennis M. Ritchie. (2008). Programovací jazyk C. Computer Press.
-
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. Addison Wesley.
-
Koenig A. (1989). C Traps and Pitfalls.. Addison-Wesley.
-
SEDGEWICK, R. (2003). Algoritmy v C, části 1- 4: základy, datové struktury, třídění, vyhledávání. Praha, Softpress.
|