Course detail

Computer Programming 2

FEKT-BPC-PP2Acad. year: 2018/2019

ANSI C language - data types, constants, operators, expressions, commands, program, function, structures, dynamic variables. Console applications - basic algorithms and programs (searching, sorting). Introduction to object programming, simple Windows applications in C++.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

doc. Ing. Jiří Šebesta, Ph.D.

Department

Department of Radio Electronics (UREL)

Learning outcomes of the course unit

Obtaining basic programming abilities and the ability of algorithmic thinking. Understanding basic properties and strctures of C and the ability to apply them. Ability of basic programming in C++.

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

The student can obtain up to 26 points for the activity in computer exercises, 14 points for tests during the semester, 20 points for the final test, and 40 points for an individual project in C/C++.

Course curriculum

1. Definition of the program 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. Searching 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

Work placements

Not applicable.

Aims

To educate students in algorithmic and programming thinking. To explain basic properties and structures of language C. To meet students with pbject programming and C++ 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

Not applicable.

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme BPC-ECT Bachelor's 2 year of study, winter semester, compulsory

Type of course unit

 

Lecture

26 hod., optionally

Teacher / Lecturer

doc. Ing. Jiří Šebesta, 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

doc. Ing. Jiří Šebesta, 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.