Minimum spanning trees: Kruskal’s and Prim’s algorithms (guest lecturer: Dr Dmitrii Pasechnik)

Shortest paths algorithms (single-source and all-pairs) (guest lecturer: Dr Dmitrii Pasechnik)

First test. Heaps

Elementary graph algorithms: breadth-first and depth-first search, topological sort, strongly connected components (guest lecturer: Dr Dmitrii Pasechnik)

Matchings; Hungarian algorithm

Second test. Divide and conquer algorithms

Introduction
Basics of algorithms analysis, time and space, big-O notation, worst-case and average-case analysis. Illustration: simple sorting algorithms

Basic data structures: stacks, queues, linked lists, hash tables.

Sorting and order statistics: heapsort, bucketsort, median selection

Binary search tree.

Greedy algorithms

Greedy algorithms

Dynamic programming

Dynamic programming

Exam