714-0582/03 – Algorithms and Data Structures (ADS)

Gurantor departmentDepartment of Mathematics and Descriptive GeometryCredits4
Subject guarantordoc. Dr. Mgr. Ivan KolomazníkSubject version guarantordoc. Dr. Mgr. Ivan Kolomazník
Study levelundergraduate or graduateRequirementChoice-compulsory
Study languageCzech
Year of introduction2000/2001Year of cancellation2009/2010
Intended for the facultiesHGFIntended for study typesBachelor
Instruction secured by
LoginNameTuitorTeacher giving lectures
PRA76 Ing. Pavel Praks, Ph.D.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2

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

Individual consultations
Other activities


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.

Way of continuous check of knowledge in the course of semester


Other requirements


Subject has no prerequisities.


Subject has no co-requisities.

Subject syllabus:

Úvod Algoritmus a jeho vlastnosti, zápis algoritmů pomocí vývojových diagramů, algoritmizace úloh, simulace práce počítače. Programovací jazyk Pascal. Konstanty, proměnné, identifikátory. Standardní datové typy, ordinální typy. Výrazy. Struktura programu v jazyku Pascal. Přiřazovací příkaz, příkazy vstupu a výstupu. Složený příkaz, podmíněné příkazy, příkazy cyklu. Strukturované datové typy. Typ pole, pole polí. Řetězce, záznamy. Množiny. Práce se soubory, textové soubory. Podprogramy. Deklarace a volání podprogramu, formální a aktuální parametry, volání parametrů hodnotou a odkazem. Bloková struktura, lokální a globální proměnné. Rekurze, rekurzivní procedury a funkce.

Conditions for subject completion

Full-time form (validity from: 1960/1961 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Exercises evaluation and Examination Credit and Examination 100 (145) 51
        Examination Examination 100  0
        Exercises evaluation Credit 45  0
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2003/2004 (B3646) Geodesy and Cartography (3646R001) Mining Surveying P Czech Ostrava 1 Choice-compulsory study plan
2003/2004 (B2102) Mineral Raw Materials (6209R013) Information and System Management P Czech Ostrava 1 Choice-compulsory study plan
2002/2003 (B2102) Mineral Raw Materials (6209R013) Information and System Management P Czech Ostrava 1 Choice-compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner