| Course title | Algorithms and Data Structure 2 |
|---|---|
| Course code | KMI/KADS2 |
| Organizational form of instruction | Lecture |
| Level of course | unspecified |
| Year of study | not specified |
| Semester | Winter |
| Number of ECTS credits | 4 |
| Language of instruction | Czech |
| Status of course | unspecified |
| Form of instruction | unspecified |
| Work placements | This is not an internship |
| Recommended optional programme components | None |
| Lecturer(s) |
|---|
|
| Course content |
|
Lectures: 1.Sorting algorithms; 1.Skiplist; 2.AVL + RedBlack trees; 3.B-trees; 4.Hash table; 5.Graphs; 6.Searching of shortest path; 7.Searching of minimum frame; 8.Searching of maximum flow; 9.Numerical algorithms; 10. Data compression.
|
| Learning activities and teaching methods |
Monologic (reading, lecture, briefing), Demonstration, E-learning
|
| Learning outcomes |
|
The second part of introductory course of algorithms and data structures is aimed above all on the problems of data structures for effective implementation of dynamic sets. The explanation includes various types of searching tree structures as binary search trees, AVL trees, R- B trees and B trees. The survey of common techniques of algorithms design (for example recursion, divide and rule, backtracking, dynamic programming, greedy algorithms) is also the part of this course.
Students will understand to the more complex algorithms, they will be able to use them in their own programs design. They will understand structures used in file systems etc. |
| Prerequisites |
|
The course has prerequisities ADS1 or ADS1A.
KMI/ADS1 ----- or ----- KMI/ADS1A ----- or ----- KMI/KADS1 ----- or ----- KMI/KDS1A |
| Assessment methods and criteria |
|
Combined exam
Credit Requirements: Examination Requirements: Final written test |
| Recommended literature |
|
| Study plans that include the course |
| Faculty | Study plan (Version) | Category of Branch/Specialization | Recommended semester |
|---|