|
Lecturer(s)
|
-
Mašek Zdeněk, Ing. Ph.D.
-
Závodník Michal, Ing.
|
|
Course content
|
1. Design and structure of a program in the C language - definition of variables, data types, constants, operators, assignments. 2. Console input and output, type conversion. 3. Control structures, cycles. 4. Functions - definition and declaration of functions, passing parameters by value, scope of variables. 5. Pointers - meaning, pointer arithmetic, passing parameters to functions by reference. 6. Field - one-dimensional, multi-dimensional. 7. Memory management - dynamic allocation. 8. Char arrays - working with strings, functions of the standard library for working with strings, arrays of strings. 9. Structures, enumeration type. 10. Area of validity of identifiers (in more detail) - memory classes, type modifiers, project consisting of multiple files. 11. Preprocessor - macros, inserting files, conditional translation. 12. Files - work with text and binary files.
|
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Skills training
- Contact teaching
- 40 hours per semester
- Term paper
- 10 hours per semester
|
|
Learning outcomes
|
Basic course in C programming language. Basic topics of this subject are: - writing programms in ANSI C using standard library - pointers and dynamic memory allocation - handling with (text) files - separate compilation, compiling big projects - advantages and disadvantages C programming language
Students will learn syntax of C programming language. They learn how to build simple console application within the scope of goals and content of this subject. Studetns will perfect logical their thinking. Knowledge of C language will utilize in folowing subjects, which are focused on microprocessors programming.
|
|
Prerequisites
|
It is assumed that student already has basic knowledge of algorithmization. Finished Algorithmization and Programming course is required.
KID/YAAAP
|
|
Assessment methods and criteria
|
Written examination, Home assignment evaluation
Student has to prove his/her knowledge during semester (active participation at exercises) and in final exam. Student creates semester project. Teacher provides particular demands at the beginning of course.
|
|
Recommended literature
|
-
HEROUT, Pavel. Učebnice jazyka C.. České Budějovice: Kopp, 2004. ISBN 8072322206.
-
Kernighan, Brian W. Programovací jazyk C. Brno: Computer Press, 2013. ISBN 978-80-251-0897-0.
-
Milková, Eva. Algoritmy : objasnění, procvičení a vizualizace základních algoritmických konstrukcí. Praha: Alfa, 2008. ISBN 978-80-87197-10-3.
-
Rubeš J. Nebojte se programovat. Computer Media, 2001. ISBN 978-80-90-28154-7.
-
Šaloun P. Programovací jazyk C pro zelenáče. Nakladatelství Neocortex, 2003.
-
Virius, Miroslav. Jazyky C a C++ : kompletní průvodce. Praha: Grada, 2011. ISBN 978-80-247-3917-5.
|