Course detail

Computers and Programming 2

FEKT-BPC2Acad. year: 2010/2011

ANSI C language - data types, constants, operators, expressions, commands, program, function. Console applications - basic algorithms and programs (searching, sorting). Borland C++ Builder - simple Windows applications.

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 Borland C++ Builder.

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 22 points for the activity in computer labs, 20 points for teste during the semester, 28 points for the final test, and 30 points for an individual project in C.

Course curriculum

Algorithmization (enriching basic knowledge from the previous semester). Defining task, defining inputs/outputs, expressing algorithm in meta-language, rewritting into programming language.
Introduction to C. Basic types, derived types, constants, operators, expressions, commands, program, functions.
Objects. Lexical elements, constants and strings, objects classes, object types.
Expressions. General rules, primary expressions, unary operators, multiplicative operators, additive operators, shift operators, relation operators, logical operators, conditioned operator.
Declaration. Structure of declarations, declaration of elementary objects, structures and units, initialization, external definition of functions, lexical range of validity.
Commands. Empty command, expression command, block command, conditioned command, switch.
Cycles. Cycles while, do and for.
Functions. Calling and returning, real arguments, recursion of functions, command goto, label.
Basic algorithms and programs. Examples and implementation of selected algorithms (searching, sorting, etc.).
Microsoft Visual C.

Work placements

Not applicable.

Aims

Educating students in algorithmic and programming thinking. Explaining basic properties and structures of language C. Preparing students for exploration of Borland C++ Builder.

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
PROKOP, J. Algoritmy v jazyku C a C++. Praha: Grada Publishing, 2008
RAIDA, Z., FIALA, P. Počítače a programování 2. Brno: FEKT VUT v Brně, 2002.

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme EECC Bc. Bachelor's

    branch B-TLI , 1 year of study, summer semester, compulsory
    branch B-EST , 1 year of study, summer semester, compulsory
    branch B-SEE , 1 year of study, summer semester, compulsory
    branch B-MET , 1 year of study, summer semester, compulsory
    branch B-AMT , 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. Milan Blaha, Ph.D.
doc. Ing. Jiří Šebesta, Ph.D.
doc. Ing. Ivo Lattenberg, Ph.D.

Syllabus

Algorithmization (enriching basic knowledge from the previous semester). Defining task, defining inputs/outputs, expressing algorithm in meta-language, rewritting into programming language.
Introduction to C. Basic types, derived types, constants, operators, expressions, commands, program, functions.
Objects. Lexical elements, constants and strings, objects classes, object types.
Expressions. General rules, primary expressions, unary operators, multiplicative operators, additive operators, shift operators, relation operators, logical operators, conditioned operator.
Declaration. Structure of declarations, declaration of elementary objects, structures and units, initialization, external definition of functions, lexical range of validity.
Commands. Empty command, expression command, block command, conditioned command, switch.
Cycles. Cycles while, do and for.
Functions. Calling and returning, real arguments, recursion of functions, command goto, label.
Basic algorithms and programs. Examples and implementation of selected algorithms (searching, sorting, etc.).

Exercise in computer lab

26 hod., compulsory

Teacher / Lecturer

doc. Ing. Jiří Šebesta, Ph.D.
Ing. Radim Kadlec, Ph.D.
Ing. Stanislav Sumec, Ph.D.
Ing. Pawan Kumar Pathak
Mgr. Irena Hlavičková, Ph.D.
doc. Ing. Jan Mikulka, Ph.D.
Ing. Michal Pokorný, Ph.D.
Ing. Jiří Vorek
Ing. Petr Fedra
Ing. Tomáš Kříž, Ph.D.
doc. Ing. Ilona Lázničková, Ph.D.
doc. Ing. Jiří Vaněk, Ph.D.
Ing. Jiří Kouřil
Ing. Martin Čáp, Ph.D.
Ing. Michal Trzos, Ph.D.

Syllabus

Algorithmization (enriching basic knowledge from the previous semester). Defining task, defining inputs/outputs, expressing algorithm in meta-language, rewritting into programming language.
Introduction to C. Basic types, derived types, constants, operators, expressions, commands, program, functions.
Objects. Lexical elements, constants and strings, objects classes, object types.
Expressions. General rules, primary expressions, unary operators, multiplicative operators, additive operators, shift operators, relation operators, logical operators, conditioned operator.
Declaration. Structure of declarations, declaration of elementary objects, structures and units, initialization, external definition of functions, lexical range of validity.
Commands. Empty command, expression command, block command, conditioned command, switch.
Cycles. Cycles while, do and for.
Functions. Calling and returning, real arguments, recursion of functions, command goto, label.
Basic algorithms and programs. Examples and implementation of selected algorithms (searching, sorting, etc.).