|
Lecturer(s)
|
-
Urbanec Tomáš, Mgr.
-
Balun Jiří, Mgr.
-
Zacpal Jiří, Mgr. Ph.D.
-
Večerka Arnošt, RNDr.
|
|
Course content
|
Algorithms and their features, time and space complexity of algorithms. Data structures. Linear data structures - lists, stack, front, and their implementation, tree data structures. Sorting problem, types of sorting algorithms. Internal sorting methods: insertion sort , Shellsort, bubble sort, Quicksort, selection sort, Heapsort, implementation of these sorting methods. Special sorting methods: Bucket sort, Radix Sort. External sorting, principles of external sorting by merging method, polyphase merge sort.
|
|
Learning activities and teaching methods
|
|
Lecture, Demonstration
|
|
Learning outcomes
|
The students become familiar with basic concepts of algorithm design.
2. Comprehension. Understand basic concepts of algorithm design.
|
|
Prerequisites
|
unspecified
|
|
Assessment methods and criteria
|
Oral exam, Written exam
Active participation in class. Completion of assigned homeworks. Passing the oral (or written) exam.
|
|
Recommended literature
|
-
Bhargava, A. Y. (2016). Algorithms.. Manning Publications Co.
-
Cormen, T. H., Leiserson C. E., Rivest D. L., Stein c. (2001). Introduction to Algorithms. MIT Press.
-
Knuth, D. (1997). The Art of Computer Programming, Volume 1, Fundamental Algorithms, Third Edition. Addison-Wesley.
-
Knuth, D. (1998). The Art of Computer Programming, Volume 3, Sorting and Searching. Addison-Wesley.
-
SEDGEWICK, R. (2003). Algoritmy v C, části 1-4: základy, datové struktury, třídění, vyhledávání. Praha, Softpress.
|