|
Lecturer(s)
|
-
Kupka Libor, Ing. Ph.D.
-
Ksiažek Jakub, Ing.
|
|
Course content
|
Lecture topics by week of the semester: 1. Overview of C language, basic language constructs and examples of C programs. 2. Definition of C language: declaration syntax, basic data types, constants, variables and arithmetic expressions. 3. Control structures, conditional expressions, operators and program cycles. 4. Console input/output (I/O), formatted I/O. 5. File I/O, working with files, end of line and end of file testing. 6. The C preprocessor: macros, insert files, conditional compilation. 7. Functions and possibilities of their definition. 8. Introduction to working with pointers, pointers vs. functions, dynamic memory allocation. 9. 1D arrays, static and dynamic arrays. 10. Strings, string functions for working with the values of string type, console and file line-oriented I/O. 11. Multi-dimensional arrays, string arrays. 12. Structures, unions and enumerations. 13. Bitwise operations and bitwise arrays. The content of the exercises corresponds to the topics of the lectures.
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Work with text (with textbook, with book), Methods of individual activities, Skills training
- Contact teaching
- 14 hours per semester
- Home preparation for classes
- 52 hours per semester
- Preparation for a credit (assessment)
- 12 hours per semester
- Preparation for an exam
- 12 hours per semester
- Term paper
- 30 hours per semester
|
|
Learning outcomes
|
The aim of this subject is to introduce students to C programming language and basic knowledge from the field of algorithmization and programming techniques in C.
After completing the course, the student demonstrates knowledge of the basics of the C programming language and is able to use basic programming techniques in this language.
|
|
Prerequisites
|
A prerequisite is basic knowledge from the field of algorithmization and programming.
|
|
Assessment methods and criteria
|
Oral examination, Written examination, Home assignment evaluation
During the semester and in the final exam, the student must demonstrate an understanding of the solved problems. The specific requirements will be communicated to the students by the teacher in the first week of the semester. Active participation in the exercises is required, including the development of all assigned tasks and the submission of the semester work.
|
|
Recommended literature
|
-
DOSTÁL, Radim. C/C++: hotová řešení. Brno: Computer Press, 2010. ISBN 978-80-251-2190-0.
-
HEROUT, Pavel. Učebnice jazyka C: 2. díl. 4. vyd. České Budějovice: KOPP, 2008. ISBN 978-80-7232-367-8.
-
HEROUT, Pavel. Učebnice jazyka C. 6. vyd. České Budějovice: KOPP, 2009. ISBN 978-80-7232-383-8.
-
KERNIGHAN, Brian W. a Denis M. RITCHIE. Programovací jazyk C: ANSI C99. Brno: Computer Press, 2006. ISBN 978-80-251-0897-X.
-
PROKOP, Jiří. Algoritmy v jazyku C a C++: praktický průvodce. Praha: Grada, 2009. ISBN 978-80-247-2751-6.
-
VIRIUS, Miroslav. Jazyky C a C++: kompletní průvodce. 2., aktualiz. vyd. Knihovna programátora. Praha: Grada Publishing, 2008. ISBN 978-80-247-3917-5.
|