| Course Unit Code | 9600-1001/01 |
|---|
| Number of ECTS Credits Allocated | 4 ECTS credits |
|---|
| Type of Course Unit * | Optional |
|---|
| Level of Course Unit * | Second Cycle |
|---|
| Year of Study * | |
|---|
| Semester when the Course Unit is delivered | Winter Semester |
|---|
| Mode of Delivery | Face-to-face |
|---|
| Language of Instruction | Czech |
|---|
| Prerequisites and Co-Requisites | Course succeeds to compulsory courses of previous semester |
|---|
| Name of Lecturer(s) | Personal ID | Name |
|---|
| DVO26 | doc. Mgr. Jiří Dvorský, Ph.D. |
| 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++. |
| Learning Outcomes of the Course Unit |
|---|
| 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. |
| Course Contents |
|---|
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 |
| Recommended or Required Reading |
|---|
| Required Reading: |
|---|
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
|
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 Reading: |
|---|
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.
|
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.
|
| Planned learning activities and teaching methods |
|---|
| Lectures, Tutorials |
| Assesment methods and criteria |
|---|
| Task Title | Task Type | Maximum Number of Points
(Act. for Subtasks) | Minimum Number of Points for Task Passing |
|---|
| Credit and Examination | Credit and Examination | 100 (100) | 51 |
| Credit | Credit | 40 | 21 |
| Examination | Examination | 60 | 30 |