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 (3.10.2008): Introduction
to algorithmic problem solving. slides , problems
Lecture 2 (10.10.2008): Algorithms
description . slides , problems
Lecture 3
(17.10.2008):
Verification of algorithms
correctness . slides , problems
Lecture 4 (24.10.2008):Analysis
of algorithms efficiency (I). slides , problems
Lecture 5 (31.10.2008):Analysis of algorithms efficiency (II) , slides , problems
Lecture 6 (7.11.2008): Sorting - basic algorithms ,
slides, problems, variants of sorting algorithms
Lecture 7 (14.11.2008): Decrease
and conquer. slides, problems (Decrease and conquer)
Lecture 8-9 (21.11.2008, 28.11.2008): Divide
and conquer. slides, problems (Divide and conquer)
Lecture 10 (5.12.2008): Greedy
technique. slides, problems (
Lecture 11-12(12.12.2008, 19.12.2008): Dynamic
programming. slides 11, slides 12, problems
Lecture 13 (9.01.2009): Backtracking. slides 11
Final test (16.01.2009):
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