full-time study course, currently not teaching
Number of teaching periods (lectures + seminars): 3+2
Termination: Credit, examination
Summary:
| Program design paradigms, complexity of algorithms, sorting - taxonomy of methods, Shellsort, Heapsort, Quicksort, Radixsort, searching, hashing, binary search, binary trees, multidimensional trees, abstract data type specification and implementation (vector, linked list, dynamic free memory, array, table, list, relation, graph), logical and physical structure of files, sorting sequential files. |
|
|
|
[1] Cormen,T.H., et al.: Introduction to ALGORITHMS. McGraw-Hill, New York 1990 [2] Manoocher, A.: Abstract Data Types and Algorithms. Macmillan Education Ltd., London |