9600-1001/01 – Algorithms and Data Structures (ADS)

Gurantor departmentIT4InnovationsCredits4
Subject guarantordoc. Mgr. Jiří Dvorský, Ph.D.Subject version guarantordoc. Mgr. Jiří Dvorský, Ph.D.
Study levelundergraduate or graduate
Study languageCzech
Year of introduction2016/2017Year of cancellation
Intended for the facultiesUSPIntended for study typesFollow-up Master
Instruction secured by
LoginNameTuitorTeacher giving lectures
DVO26 doc. Mgr. Jiří Dvorský, 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

Upon the successful completion of the course, graduates will be able to implement discussed data structures, use them, and compile them into more complex units.

Teaching methods



The aim of the course is to introduce students to basic data structures including related algorithms. The data structures and algorithms will be described using object-oriented programming in C++.

Compulsory literature:

1. Sedgewick R. Algoritmy v C, části 1-4, SoftPress, Praha, 2003. ISBN 80-86497-56-9. Alternativně anglicky Sedgewick, R. Algorithms in C++. 3rd edition. Addison-Wesley Publishing Company, 1998. ISBN 978-0201350883 2. Dvorský J. Algoritmy I. Elektronický studijní materiál dostupný na http://www.cs.vsb.cz/dvorsky/Opora.html

Recommended literature:

1. Wróblewski P. Algoritmy. Datové struktury a programovací techniky, Computer Press, Praha 2003. ISBN 80-251-0343-9 2. Wirth, N. Algoritmy a štruktúry údajov. Alfa, Bratislava, 1989. ISBN 80-05-00156-3 3. STROUSTRUP, B. C++ Programovací jazyk. BEN-technická literatura, Praha 1997. Alternativně anglicky STROUSTRUP, B. The C++ Programming Language, 4th Edition, Addison-Wesley Professional 2013, ISBN-13: 978-0321563842 4. Cormen, Leiserson, Rievest: Introduction to Algorithms, MIT Press, 2001.

Way of continuous check of knowledge in the course of semester


Další požadavky na studenta

Programming skills in one of the commonly-used languages - C, C ++, Java, C #, Basic, Pascal, and similar.


Subject has no prerequisities.


Subject has no co-requisities.

Subject syllabus:

1. Procedural Programming in C++ 2. Object-oriented Programming in C++, Specifications of OOP in C++ 3. Object-oriented Programming in C++, Dynamical Memory Allocation, Pointers 4. Field in C++, Multi-dimensional Fields, Pointer Arithmetic 5. Storage, Front, List 6. Graph as Data Structures, Passages in Graphs 7. Binary Search Tree, Fundamental Algorithms 8. Binary Search Trees, Red-Black Tree, Splay Tree 9. B-Trees 10. Spatial Tree Structures, R-Tree, UB-Tree, K-D Tree 11. Hashing 12. Data Structures in Shared-Memory Environment

Conditions for subject completion

Full-time form (validity from: 2016/2017 Winter semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of points
Credit and Examination Credit and Examination 100 (100) 51
        Credit Credit 40  21
        Examination Examination 60  30
Mandatory attendence parzicipation:

Show history

Occurrence in study plans

Academic yearProgrammeField of studySpec.FormStudy language Tut. centreYearWSType of duty
2018/2019 (N2658) Computational Sciences (2612T078) Computational Sciences P Czech Ostrava 1 Compulsory study plan
2017/2018 (N2658) Computational Sciences (2612T078) Computational Sciences P Czech Ostrava 1 Compulsory study plan
2016/2017 (N2658) Computational Sciences (2612T078) Computational Sciences P Czech Ostrava 1 Compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner