Ing. Miloslav Richter, Ph.D.

Department of Control and Instrumentation (UAMT)

The student is able:
- analyze task and make flowchart
- work with keywords, make simple examples of their using
- identify and correctly use proper data types
- work with dynamically allocated memory
- use standart input and output
- work with files
- use basic C libraries
- write simple program usign functions
- use basic algorithms for sortin, searching, linear lists
- understand code of others

Attending BPC1 course or similar.

Not applicable.

Not applicable.

PROKOP, J. Algoritmy v jazyku C a C++. Praha: Grada Publishing, 2008 (CS)
PECINOVSKÝ, R., VIRIUS, M. Učebnice programování: základy algoritmizace. Praha: Grada Publishing, 1997 (CS)
RAIDA, Z., FIALA, P. Počítače a programování 2. Edice "Elektronická skripta". Brno: FEKT VUT v Brně, 2002. (CS)
VIRIUS, M. Jazyky C a C++. Komplexní kapesní průvodce. Praha: Grada Publishing, 2005 (CS)
RICHTER, M., PETYOVSKÝ, P., HORÁK, K., KALOVÁ, I. elektronicke texty Prakticke programovani v cpp SL. Brno: 2004. (CS)
Herout,P.: Učebnice jazyka C. Kopp. ISBN: 978-80-7232-383-8 (CS)
Kernigham, B.W. Richie, D.M (Virius,M.): Programovací jazyk C. Brno. Computer Press, 2006. ISBN 80-251-0897-X (CS)
Knuth, D.E.: Umění programování. Brno. Computer Press. 2008. EAN 9788025120255 (CS)
Wróblewski,P.: Algoritmy – Datové struktury a programovací techniky. Brno. Computer Press.2004. ISBN 80-251-0343-9 (CS)
Knuth, D.E: The Art of Computer Programming (TAOCP), Reading, Meassachusetts, Addison-Wesley, 1997, ISBN 0-201-89683-4 (EN)
Kernigham, B.W. Richie, D.M.: C Programming Language, Prentice Hall, 1988, ISBN 0-13-110362-8 (EN)

Teaching methods include lectures and computer laboratories. Course is taking advantage of www pages coupled with e-learning (Moodle) system. Student knowledges are tested by exercises during the term.

Activity on excercises - up to 10 pts.
3 tests on excercises - up to 30pts each. Tests verify the knowledge of tought topics of lectures and exercises. Task represents the modification and extension of program, started in the homework or previous exercises.
(All tests are taken during semestr, there is no resit).
Requirements for completion of a course are specified by a regulation issued by the lecturer responsible for the course and updated for every year.

Czech

Not applicable.

1) Course overwiev. Language history. Program structure and source code creation. Bit operations. Preprocessor.
2) Algorithms - sorting.
3) Standard and formated I/O.
4) Work with files.
5) Enum. State diagram, state machime. Math.h library.
6) Address, data type, pointer, value - and their realations. Pointer arithmetics.
7) Pointer and function.
8) Dynamic memory, alocation (stdlib.h). Fields in more dimensions.
9) Lifetime of variables. Strings, library for string manipulation - string.h.
10) .User defined composite types - struct, union, enum, bitfield.
11) Inline functions. Lists. Binary trees.
12) C99, C1X. _Bool (stdbool.h), complex, literals.
13) Const, volatile, restrict. Programming styles.

Content of seminars: practical exercises based on lecture topics.

Students are educated algorithmic and programming skils, based on C language. Basic properties and structures of language are explained. Simple programs are written with code design, creation and testing explatnation.

The content and forms of instruction in the evaluated course are specified by a regulation issued by the lecturer responsible for the course and updated for every academic year.

• Programme EEKR-B Bachelor's

  branch B-AMT , 1. year of study, summer semester, 5 credits, compulsory
  

• Programme EEKR-CZV lifelong learning

  branch ET-CZV , 1. year of study, summer semester, 5 credits, compulsory
  

26 hours, compulsory

Ing. Ondřej Boštík
Ing. Miloslav Richter, Ph.D.

eLearning: currently opened course