Conducted in terms:
Winter Semester 2007/08
Winter Semester 2008/09
Winter Semester 2009/10
Winter Semester 2010/11
Winter Semester 2011/12
Winter Semester 2012/13
Winter Semester 2013/14

ECTS credits: 7

Language: Polish

Organized by: Faculty of Computer Science

Algorithms and Data Structures I23022

Course content:
Property of algorithm. Time complexity.Divide-and-conquer paradigm, dynamic-programming paradigm. Trees a strucutes for a dictionary implementation. Hash tabels. Structures for praphs representation. Graph algorithms. Approximation algorithm. Backtracking. NP i NPC problems.
Learning outcomes:
Analyze the asymptotic performance of algorithms.
Demonstrate a familiarity with major algorithms and data structures. Apply important algorithmic design paradigms and methods of analysis. Synthesize eficient algorithms in common engineering design situations.

(in Polish) Rodzaj przedmiotu

(in Polish) Obowiązkowy

Course coordinators

Term 2013Z:

Term 2009Z:

Term 2010Z:

Term 2012Z:

Term 2011Z:

Bibliography

a) basic references:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, introduction to algorithms, 2. R. Neapolitan, K. Namipour, Background of algorithms with examples in C++.
b) supplementary references:
1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, Designing and analeze of computer algorithms2. Banachowski, K. Diks, W. Rytter, Algorithms and Data Structures 3. A. Drozdek, D. L. Simon Data Structures in C4. N. Wirth, Algorithms + data stryctures = programs