Course detail

Algorithms

FEKT-KIZPAcad. year: 2011/2012

Algorithms and problem solving: strategy of problem solving, structured decomposition, concept and features of algorithm. Basic programming construction: syntax and semantics of high programming language, variables, type, assignment, control structures, procedure and functions, parameter passing, input/output, exceptional state processing. Basic data structure: simple data types, structured data typed: array, record, file, strings. Dynamic data structures, concept of pointers. Strategy for selecting appropriate data structure. Recursion, concept of recursion. Global and local variables. Simply recursion procedures. Modular Design and abstraction. Concepts will be illustrated by using appropriate programming language. (ISO/IEC 9899: Programming languages - C).

Language of instruction

Czech

Number of ECTS credits

Mode of study

Not applicable.

Guarantor

doc. RNDr. Jitka Kreslíková, CSc.

Department

Faculty of Information Technology (FIT)

Learning outcomes of the course unit

Student acquaints with the methods of analysing and designing simple computer algorithms. Student will introduced to the fundamental concepts of programming languages. Student gets up how to write programs in high programming languages. Student gets up how to use EBNF to describe programming language syntax. Student acquires basic English terminology of programming, syntax, and semantics of programming language.

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

Evaluated home assignments with the defence: 35 points. Mid-term written examination: 15 points. Final written examination: 50 points.

Course curriculum

Properties of algorithms, notations for describing algorithms.
Problem solving techniques. Design and implementation of algorithms
Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers repesentation, labels.
The concept of data. Simple data types. Expression and statements.
Control structures. Blocks, scope and activation.
Functions, parameters of functions.
Text file standard input and output.
Structured data types.
Recursion.
Pointer types and dynamic variables. Linked structures.
Sorting.
Searching.
Program verification, debugging, documentation.

Work placements

Not applicable.

Aims

To grasp an analysis of problems and to determine basic algorithms for their solving. To acquaint oneself with principles and features of high programming language and to possess them for implementing of algorithms. To learn how to use tools for program debugging. To get basic knowledge of data representation in memory. To make the acquaintance of evaluate algorithm complexity. To make the acquaintance of testing principles of programs. To possess active basic algorithms. To learn how to document, present and defend the reached results.

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

Jinoch J., Muller K., Vogel J.: Programování v jazyku Pascal, SNTL, Praha, 1988.
Wirth N.: Algoritmy a štruktúry údajov, Alfa Bratislava, 1988.
Wirth N.,Jensen K.: Pascal User manual and report, ISO Pascal Standard, Springer-Verlag, 1991.

Recommended reading

Not applicable.

Classification of course in study plans

  • Programme EECC Bc. Bachelor's

    branch BK-TLI , 3 year of study, winter semester, elective interdisciplinary

  • Programme EEKR-CZV lifelong learning

    branch EE-FLE , 1 year of study, winter semester, elective interdisciplinary

Type of course unit

 

Lecture

39 hod., optionally

Teacher / Lecturer

doc. RNDr. Jitka Kreslíková, CSc.

Syllabus

Properties of algorithms, notations for describing algorithms.
Problem solving techniques. Design and implementation of algorithms
Principles of high level programming languages. Symbols and separators, constants, identifiers, variables, numbers representation, labels.
Expression and statements.
Text file input and output.
The concept of data. Simple data types, structured data types.
Structured programming. Control structures. Blocks, scope and activation.
Procedures and functions, parameters.
Recursion.
Pointer types and dynamic variables. Linked structures.
Sorting.
Searching.
Program verification, debugging, documentation.

Exercise in computer lab

26 hod., optionally

Teacher / Lecturer

doc. RNDr. Jitka Kreslíková, CSc.

Syllabus

Turbo Pascal. Getting started. Editing programs. Program structure. Help.
Tools for debugging. Standard libraries. Simple programs in Turbo Pascal language.
Tutorial on home assignment (calculation.) Defence of the home assignment.
Tutorial on home assignment (matrix). Defence of the home assignment.
Tutorial on home assignment (file handling). Defence of the home assignment.
Tutorial on home assignment (program units) Defence of the home assignment.