C Programming Language
Code | Completion | Credits | Range | Language |
---|---|---|---|---|
BE5B99CPL | Z,ZK | 6 | 2P+2C+5D | English |
- Relations:
- It is not possible to register for the course BE5B99CPL if the student is concurrently registered for or has already completed the course B6B36PCC (mutually exclusive courses).
- During a review of study plans, the course B6B36PJC can be substituted for the course BE5B99CPL.
- It is not possible to register for the course BE5B99CPL if the student is concurrently registered for or has already completed the course B6B36PJC (mutually exclusive courses).
- It is not possible to register for the course BE5B99CPL if the student is concurrently registered for or has previously completed the course B6B36PCC (mutually exclusive courses).
- It is not possible to register for the course BE5B99CPL if the student is concurrently registered for or has previously completed the course B6B36PJC (mutually exclusive courses).
- Course guarantor:
- Jan Faigl
- Lecturer:
- Tomáš Krajník, Yuliia Prokop
- Tutor:
- Jan Blaha, Tomáš Krajník, Yuliia Prokop, Jiří Ulrich
- Supervisor:
- Department of Computer Science
- Synopsis:
-
The course provides complete knowledge of the C programming language regarding a program structure operation, memory access, and multi-thread applications. The course emphasis a ?good? programming style to develop clean, easy-to-read, and re-usable code. Students are introduced into the process of the source code compilation and active debugging. Lectures introduce basic code structures and demonstration applications which link together partial constructs and practical coding aiming for cleanliness and structure of the source code, computational efficiency optimized using code profiling and debugging. Students are introduced into the fundamental principles of parallel multi-thread programming, synchronization mechanism and multi-thread application models. The end of the course presents introduction to principles of object oriented programming and C++.
- Requirements:
-
Basic knowledge of programming and algorithms is expected as taught in ?Algoritmy a programování?.
- Syllabus of lectures:
-
1. C programming language basics, language characteristics, compilation model, syntax, structure of program and function.
2. Data types ? memory alignment, declarations, operators, statements and code flow control structures
3. Commands, standard input/output operations. Functions, macros, preprocessing and standard libraries
4. Pointers, static and dynamic memory allocations; arrays and strings; multi-dimensional arrays; functions and parameter passing (call by value, call by reference) - stack
5. Structures and unions, enumeration types and their internal representation
6. Modules, projects, control of compilation (makefiles) conditional compilation ? application example
7. Files, interface ? binary and text files, direct and sequential access to the files
8. Program debugging, exception handling,
9. History of C language ? versions and standards, ANSI C, C99, C11, extensions, cross platform compatibility, compilers
10. Parallel programming ? multi-thread programming, methods and synchronizations primitives
11. Parallel programming ? multi-thread application models
12. Main differences between C and C ++
13. Object oriented programming principles: class, object, encapsulation, polymorphism, and inheritance
14. Software project management and version control software
- Syllabus of tutorials:
-
During practical exercises students learn and exercise programming style to be able to independently develop clean, cross-platform usable code which will be tested not only on a personal computer but also at dedicated embedded boards such as Raspberry Pi. Students gain points for every successfully evaluated task and written programming tests. The points are given for correctness of the code, its effectiveness, and the quality of the source code is evaluated together with the code cleanliness and possibility of its reusability.
- Study Objective:
- Study materials:
-
.N. King: C Programming A Modern Approach, Second Edition. W. W. Norton & Company, Inc., 2008
Sedgewick, Wayne: Algorithms (4th Edition), 2011, ISBN 978-0321573513
- Note:
- Further information:
- https://cw.fel.cvut.cz/wiki/courses/BE5B99CPL
- Time-table for winter semester 2024/2025:
-
06:00–08:0008:00–10:0010:00–12:0012:00–14:0014:00–16:0016:00–18:0018:00–20:0020:00–22:0022:00–24:00
Mon Tue Wed Thu Fri - Time-table for summer semester 2024/2025:
- Time-table is not available yet
- The course is a part of the following study plans:
-
- Electrical Engineering and Computer Science (EECS) (compulsory elective course)
- Electrical Engineering and Computer Science (EECS) (compulsory elective course)