714-0588 – Creation and implementation of algorithm's (VRA)

Gurantor department	Department of Mathematics and Descriptive Geometry
Subject guarantor	doc. Dr. Mgr. Ivan Kolomazník
Study level	undergraduate or graduate

Subject version
Version code	Year of introduction	Year of cancellation	Credits
714-0588/01	2006/2007	2017/2018	5
714-0588/02	1999/2000	2018/2019	5
714-0588/03	1999/2000	1999/2000	5
714-0588/04	2016/2017	2018/2019	5

Subject aims expressed by acquired skills and competences

The main goal of the course is to acquaint with basic principles of problem solving using computers, to acquaint with basic abstract data types and to master their implementation and exploitation. The students shall gain knowledge and skills necessary for algorithm design, coding in a programming language (Delphi) and debugging.

Teaching methods

Lectures
Individual consultations
Tutorials
Other activities

Summary

Concepts of algorithmic problem solving, an introduction to programming methodology. Data and control structures of the programming language. Constants, variables, identifiers, expressions. Simple data types, ordinal types. Control structures. Assignment statement, I/O statements, conditional statements, loop statements. Structured data types. Arrays, strings, records, sets, files, text files. Procedure and function definition, call by value parameters, call by reference. Block structure. Local and global variables, recursion.

Compulsory literature:

Kolomazník, I.: Computer Technics and Algorithms, VŠB – TUO, Ostrava 2005, ISBN 80-248-0799-8

Recommended literature:

Wirth, N.: Algorithms + Data Structures = Programs. Prentice Hall, New Jersey, 1976.

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.