Course detail

Computers and Programming 2

FEKT-BKC-PC2MAcad. year: 2018/2019

The course is focussed on the basic knowledge of ANSI/ISO C programming. Students learn to design algorithms solving assigned tasks, using appropriate data types or designing custom data structures together with implementation of the solution in ANSI/ISO C language. Algorithms for numerical and text data are presented, students are introduced with the standard libraries, working with files, pointers, dynamic memory allocation and creation of own custom libraries.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

Ing. Ondřej Čech, Ph.D.

Department

Department of Electrical and Electronic Technology (UETE)

Learning outcomes of the course unit

The student is able to:
- explain the function of the C language statements,
- describe the properties of the basic data types,
- propose a structure for the representation of complex data,
- use functions included in the standard libraries,
- propose an algorithm working with multi-dimensional and one-dimensional array,
- propose an algorithm to sort a list of values,
- create a library of functions,
- create an interactive application.

Prerequisites

The subject knowledge on the secondary school level is required.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Assesment methods and criteria linked to learning outcomes

Requirements for successful completion of the subject are specified by guarantor’s regulation updated for every academic year.

Course curriculum

1. General course overview. History of the C language, standards and language characteristics. IDE overview. Basic variable types, arrays. Declaration and initialization of variables. Global and local variables. Standard imput and output, basic programs.
2. Expressions, arithmetic conversions, operators. Priorities of operators, assignment.
3. Program branching, loops, conditionals, jumps, recursive notation.
4. Strings, array filed witn NULL terminated string, Literals, ASCII table and charsets.
5. Pointers, pointer to array, pointer arithmetics. Arrays of pointers
6. Functions. Recursive function. Functions and memory.
7. Advanced data types.Union, enum, dynamic variable, pointer. Debugging
8. Dynamic memory allocation
9. Header files and libraries, preprocessor commands.
10. Hands on files, reading and writing
11. Linking of dynamically assigned structures with pointers, linear database tree
12. Const, volatile modificator, new standards in C language

Work placements

Not applicable.

Aims

The aim of the course is to introduce students to the problem of general programming habits and algoritmization of technical taksk together with the implementation in ANSI/ISO C programming language.

Specification of controlled education, way of implementation and compensation for absences

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.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

PECINOVSKÝ, R., VIRIUS, M. Učebnice programování: základy algoritmizace. Praha: Grada Publishing, 1997 (CS)
PROKOP, J. Algoritmy v jazyku C a C++. Praha: Grada Publishing, 2008 (CS)
RAIDA, Z., FIALA, P. Počítače a programování 2. Edice "Elektronická skripta". Brno: FEKT VUT v Brně, 2002. (CS)

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme BKC-MET Bachelor's 1 year of study, summer semester, compulsory

  • Programme EEKR-CZV lifelong learning

    branch EE-FLE , 1 year of study, summer semester, compulsory

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

Ing. Ondřej Čech, Ph.D.

Syllabus

1. Algorithmization (extensions of basic knowledge from the previous semester). Definition of the task, the definition of inputs / outputs, expressing
an algorithm in meta-language, rewritting into programming language.
2. Introduction to C language. Basic types of variables, derived types, constants, arrays.
3. Expressions, arithmetic conversions, arithmetic operators, shift operators, relation operators, logical operators, bitwise operators, assignment
operators, operator priority.
4. Strings and their operators, library functions, standard library string.h.
5. Commands, compound statements, branching commands, cycles and control commands. Flowchart.
6. Function. Declaration of functions, methods of function calling, treatment events, recursion of functions.
7. Advanced data types. Union, enum, dynamic variable, pointer.
8. Objects. Lexical elements, constants and strings, classes, objects, object types.
9. User interface of Microsoft Visual C++ Studio. Graphical components.
10. Algorithms I. Finding maxima and minima, sorting.
11. Algorithms II. Programming with arrays, matrices operations.
12. Algorithms III. Programming with files in Windows.
13. Algorithms IV. Database systems. Records, sorting, searching, statistics. Linking of databases.

Exercise in computer lab

26 hod., compulsory

Teacher / Lecturer

Ing. Ondřej Čech, Ph.D.

Syllabus

1. Algorithmization (extensions of basic knowledge from the previous semester). Definition of the task, the definition of inputs / outputs, expressing
an algorithm in meta-language, rewritting into programming language.
2. Introduction to C language. Basic types of variables, derived types, constants, arrays.
3. Expressions, arithmetic conversions, arithmetic operators, shift operators, relation operators, logical operators, bitwise operators, assignment
operators, operator priority.
4. Strings and their operators, library functions, standard library string.h.
5. Commands, compound statements, branching commands, cycles and control commands. Flowchart.
6. Function. Declaration of functions, methods of function calling, treatment events, recursion of functions.
7. Advanced data types. Union, enum, dynamic variable, pointer.
8. Objects. Lexical elements, constants and strings, classes, objects, object types.
9. User interface of Microsoft Visual C++ Studio. Graphical components.
10. Algorithms I. Finding maxima and minima, sorting.
11. Algorithms II. Programming with arrays, matrices operations.
12. Algorithms III. Programming with files in Windows.
13. Algorithms IV. Database systems. Records, sorting, searching, statistics. Linking of databases.