Design and Analysis of Algorithms

Overview

Students will get acquainted with a number of typical algorithms used in various areas of mathematics, general principles underlying the design of such algorithms, and methods for complexity analysis.

The final grade will be determined by the number of points collected in the quizzes and the final exam.

Organization

Winter Semester 2020.

• Number: 3260D1
• Title: Design and Analysis of Algorithms
• Lecturer: Temur Kutsia
• Time: Thu 14:30 - 16:00
• Place: T 406
• Language: English
• First lecture: October 8.

Registration

Please register for the course via the KUSSS system.

Contents

• Assymptotic notation.
• Solving Recurrences.
• Divide and conquer.
• Sorting.
• Dynamic programming.
• Greedy algorithms.
• Graph Algorithms: Single-Source Shortest Paths.
• String matching.
• Unification algorithms.

Course Materials

• Book: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms. Third Edition. The MIT Press, 2009.
• Slides: Slides and other supplementary materials will appear in Moodle.

Maintained by Temur Kutsia.