Lecturer(s)
|
-
Futera Zdeněk, RNDr. Ph.D.
|
Course content
|
1 - Introduction into programming, variables, constants, identifiers 2 - Operators in C/C++, conditional construction 3 - Loops and iterations 4 - Pointers and references, operations, dynamic memory allocation 5 - Pointers ande references, advanced operations 6 - Functions and their parameters 7 - User defined data types, structures and unions 8 - File operations in C and C++ 9 - Program modularity, namespaces, preprocesor, code optimalization 10 - Recursive functions and algorithms 11 - Algorithms for searching and sorting 12 - Linear lists, hash tables 13 - Stack and Queue and their implementation
|
Learning activities and teaching methods
|
Monologic (reading, lecture, briefing), Demonstration
- Class attendance
- 52 hours per semester
- Preparation for classes
- 52 hours per semester
- Preparation for exam
- 30 hours per semester
- Preparation for credit
- 20 hours per semester
|
Learning outcomes
|
Introduction to programming and algorithmization - active knowledges will be required, syntax of the C programming language.
Students learn how to programming in C language.
|
Prerequisites
|
No specific requirements.
|
Assessment methods and criteria
|
Systematic student observation, Combined exam
|
Recommended literature
|
-
Jiří Prokop, Algoritmy v jazyku C a C++.
-
Pavel Herout, Učebnice jazyka C (1. díl).
-
Pavel Herout, Učebnice jazyka C (2.díl). 2008.
-
Stroustrup: The C++ Programming Language (4th Edition).
|