Algorithmics - english
Overview:
This is a one-semester course for the first year students of the
Computer Science section. The aim of the course is to present the basic
concepts of the algorithms design and analysis.
Contents:
- Algorithmic problem solving and description of algorithms
- Verification of algorithms correctness
- Analysis of algorithms efficiency
- Elementary sorting methods
- "Decrease and conquer" and "Divide and conquer" techniques. Recursivity. Applications and
complexity analysis
- Greedy technique. Applications
- Dynamic programming technique. Applications
- Backtracking technique. Applications
- Branch and bound. Applications
- Pattern matching
Prerequisites:
Online materials:
Lecture 1 (2.10.2009): Introduction
to algorithmic problem solving. slides
Lecture 2 (9.10.2009): Algorithms
description . slides
Lecture 3
(16.10.2008): Verification of algorithms
correctness . slides
Lecture 4 (23.10.2009):Analysis
of algorithms efficiency (I). slides
Lecture 5 (30.10.2009):Analysis of algorithms efficiency (II) , slides
Lecture 6 (6.11.2009): Sorting - basic algorithms ,
slides
Lecture 7 (13.11.2009): Decrease
and conquer. slides
Lecture 8-9 (20.11.2009, 27.11.2009): Divide
and conquer. slides
Lecture 10 (4.12.2009): Greedy
technique. slides
Lecture 11(11.12.2009): Dynamic
programming (I). slides
Lecture 12(18.12.2009): Dynamic
programming (II), slides
Lecture 13 (8.01.2010): Backtracking. slides
Lecture 14: Additional topics. Revision.
Problems:
Problems set 1
Problems set 2
Problems set 3
Seminar 4: test
Problems set 5
Problems set 6
Problems set 7
Bibliography:
- T.H. Cormen, C.E.Leiserson, R.R. Rivest– Introduction to
algorithms, Mit Press 1990.
- R. Johnsonbaugh, M. Schaefer - Algorithms, Pearson Education,
2004
- A. Levitin - The design & analysis of algorithms, Addison
Wesley, 2003
Go back to index