Lecturer(s)


Beránek Ladislav, doc. Ing. CSc.

Course content

1. Graphs and their representations 2. Searching in the graph space 3. Shortest path in the graph 4. Minimum spanning trees 5. Maximum flow 6. Divide and conquer algorithm 7. Dynamic programming 8. String matching 9. Hash tables 10. Encription algorithms

Learning activities and teaching methods

Monologic (reading, lecture, briefing)
 Semestral paper
 12 hours per semester
 Class attendance
 56 hours per semester
 Preparation for credit
 24 hours per semester
 Preparation for exam
 24 hours per semester
 Preparation for classes
 34 hours per semester

Learning outcomes

The subject Algoritmy II will introduce the advanced algorithmic methods and processes. The ways of graph representations and the basic graph algorithms will be explained. A part of the course also includes a summary of general techniques in algorithmic design such as recursion, divide and conquer, backtracking, dynamic programming and greedy algorithms. Also the hash tables and encription algorithms will be explained.
Students will understand more complex algorithms, they will be able to use them in their own programs designing. The will have an overview about algorithms using in operating system (file tables), computer networks (routing) and basic methods of compression.

Prerequisites

The subjet Algorithms I  UAI/686

Assessment methods and criteria

Written examination
Working out a seminar work (design of program in any programming language with a chosen algorithm), fulfillment of final written test.

Recommended literature


CORMEN, T., H.  LEISERSON, CH., E.  RIVEST, R. R. Introduction to Algorithms. The MIT Press, 1994..

Mareš, M., Valla, T. PRŮVODCE LABYRINTEM ALGORITMŮ. Praha, 2017. ISBN 788088168225.

MCMILLAN, M. Data Structures and Algorithms Using C#. New York: Cambridge University Press, 2007..

PREISS, B., R. Data Structures and Algorithms with ObjectOriented Design Patterns in Java. John Wiley & Sons, 2000..

Prokop, J. Algoritmy v jazyku C a C++. Praha: Computer Press, 2015. ISBN 9788024754673.

SEDGEWICK, R., WAYNE, K.D. Algorithms. AddisonWesley Professiona, 2015. ISBN 9780134384689.

Wróblewski, P. Algoritmy. Praha: Computer Press, 2015. ISBN 9788025141267.
