Course: Algorithm II - teaching at high schools

« Back
Course title Algorithm II - teaching at high schools
Course code UAI/689U
Organizational form of instruction Lecture + Lesson
Level of course Bachelor
Year of study not specified
Frequency of the course In each academic year, in the summer semester.
Semester Summer
Number of ECTS credits 5
Language of instruction Czech
Status of course Compulsory
Form of instruction Face-to-face
Work placements unspecified
Recommended optional programme components None
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 78-80-88168-22-5.
  • MCMILLAN, M. Data Structures and Algorithms Using C#. New York: Cambridge University Press, 2007..
  • PREISS, B., R. Data Structures and Algorithms with Object-Oriented Design Patterns in Java. John Wiley & Sons, 2000..
  • Prokop, J. Algoritmy v jazyku C a C++. Praha: Computer Press, 2015. ISBN 978-80-247-5467-3.
  • SEDGEWICK, R., WAYNE, K.D. Algorithms. Addison-Wesley Professiona, 2015. ISBN 978-0134384689.
  • Wróblewski, P. Algoritmy. Praha: Computer Press, 2015. ISBN 9788025141267.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester