|
Lecturer(s)
|
-
Konečný Jan, doc. RNDr. Ph.D.
-
Osička Petr, Mgr. Ph.D.
|
|
Course content
|
This part of a four=semester course is devoted to the design and analysis of algorithms. 1. Asymptotic notation for growth of functions, properties and applications in the analysis of complexity of algorithms. 2. Recurrences, propeties and applications in the analysis of complexity of algorithms. 3. Divide and conquer method for design of algoritms, examples. 4. Greedy method for design of algoritms, examples. 5. Dynamic programming method for design of algoritms, examples. 6. Iterative improvement method for design of algoritms, examples. 7. Brute force method for design of algoritms, backtracking and branch-and-bound techniques, examples.
|
|
Learning activities and teaching methods
|
|
Lecture, Demonstration
|
|
Learning outcomes
|
The students become familiar with selected concepts of algorithm design.
4. Analysis Analyze advanced algorithms.
|
|
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
|
-
Anany Levitin. (2003). The design & Analysis of Algorithms. Addison Wesley.
-
Bhargava, A. Y. (2016). Algorithms.. Manning Publications Co.
-
CORMEN, T. H., LEISERSON C. E., RIVEST D. L., STEIN C. (2001). Introduction to Algorithms, Second Edition. MIT Press.
-
Dasgupta, S., Papadimitriou, C. H., Vazirani U. (2006). Algorithms. McGraw-Hill Education.
-
Kleinberg J., Tardos, E. (2006). Algorithm design. Pearson Education.
-
Kozen, D.C. (1992). The design and analysis of algorithms. Springer.
-
Manber U. (1989). Introduction to Algorithms. A creative approach.. Addison-Wesley.
-
Skiena, S.S. (2012). The Algorithm Design Manual. Springer-Verlag.
|