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

Gurantor department	IT4Innovations	Credits	4
Subject guarantor	doc. Mgr. Jiří Dvorský, Ph.D.	Subject version guarantor	doc. Mgr. Jiří Dvorský, Ph.D.
Study level	undergraduate or graduate	Requirement	Optional
Year		Semester	winter
		Study language	English
Year of introduction	2016/2017	Year of cancellation	2023/2024
Intended for the faculties	USP, FEI	Intended for study types	Follow-up Master

Instruction secured by
Login	Name	Tuitor	Teacher giving lectures
DVO26	doc. Mgr. Jiří Dvorský, Ph.D.

Extent of instruction for forms of study
Form of study	Way 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

Lectures
Tutorials

Summary

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.

Additional study materials

Study supports in the EduDocs system

Way of continuous check of knowledge in the course of semester

E-learning

Other requirements

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

Prerequisities

Subject has no prerequisities.

Co-requisities

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: 2017/2018 Winter semester, validity until: 2023/2024 Summer semester)

Task name	Type of task	Max. number of points (act. for subtasks)	Min. number of points	Max. počet pokusů
Credit and Examination	Credit and Examination	100 (100)	51
Credit	Credit	40	20
Examination	Examination	60	31	3

Valid from	Valid until	Mandatory attendence participation
Feb 20, 2018 9:48:30 PM	Sep 16, 2022 5:22:59 PM	Project implementation, participation in consultations.

Mandatory attendence participation: Participation in the exercises is compulsory and is monitored. The scope of the compulsory participation will be communicated to the students by the course supervisor at the beginning of the semester.

Show history

Conditions for subject completion and attendance at the exercises within ISP: Course completion requirements - Completion of all mandatory tasks within individually agreed deadlines. Attendance at exercises - The level of attendance at exercises is agreed by the student with the course supervisor at the beginning of the semester.

Show history

Occurrence in study plans

Academic year	Programme	Branch/spec.	Form	Study language	Tut. centre	Year	Type of duty
2023/2024	(N0541A170008) Computational and Applied Mathematics	(S02) Computational Methods and HPC	P	English	Ostrava		Optional	study plan
2023/2024	(N0541A170008) Computational and Applied Mathematics	(S01) Applied Mathematics	P	English	Ostrava		Optional	study plan
2022/2023	(N0541A170008) Computational and Applied Mathematics	(S01) Applied Mathematics	P	English	Ostrava		Optional	study plan
2022/2023	(N0541A170008) Computational and Applied Mathematics	(S02) Computational Methods and HPC	P	English	Ostrava		Optional	study plan
2021/2022	(N0541A170008) Computational and Applied Mathematics	(S01) Applied Mathematics	P	English	Ostrava		Optional	study plan
2021/2022	(N0541A170008) Computational and Applied Mathematics	(S02) Computational Methods and HPC	P	English	Ostrava		Optional	study plan
2020/2021	(N0541A170008) Computational and Applied Mathematics	(S02) Computational Methods and HPC	P	English	Ostrava		Optional	study plan
2020/2021	(N0541A170008) Computational and Applied Mathematics	(S01) Applied Mathematics	P	English	Ostrava		Optional	study plan
2019/2020	(N0541A170008) Computational and Applied Mathematics	(S01) Applied Mathematics	P	English	Ostrava		Compulsory	study plan
2019/2020	(N0541A170008) Computational and Applied Mathematics	(S02) Computational Methods and HPC	P	English	Ostrava		Optional	study plan
2018/2019	(N2658) Computational Sciences	(2612T078) Computational Sciences	P	English	Ostrava	1	Compulsory	study plan
2017/2018	(N2658) Computational Sciences	(2612T078) Computational Sciences	P	English	Ostrava	1	Compulsory	study plan
2016/2017	(N2658) Computational Sciences	(2612T078) Computational Sciences	P	English	Ostrava	1	Compulsory	study plan

Occurrence in special blocks

Block name	Academic year	Form of study	Study language	Year	W	S	Type of block	Block owner

Assessment of instruction

Předmět neobsahuje žádné hodnocení.