Conducted in terms:
Winter Semester 2009/10
Winter Semester 2010/11
Winter Semester 2011/12
Winter Semester 2012/13
Winter Semester 2013/14
Winter Semester 2014/15

ECTS credits: 7

Organized by: Faculty of Computer Science

Algorithms and Data Structures IN082106

Course content:
Analysis of algorithms (correctness, computational complexity). Coding techniques (e.g. recursion) and programming techniques 'divide and conquer', dynamic programming, greedy algorithms). Fundamental algorithms on data structures such as lists, stacks, queues, trees, graphs

Learning outcomes:
In accordance with the content of the course.

(in Polish) Rodzaj przedmiotu

(in Polish) Obowiązkowy

Course coordinators

Term 2009Z:

Anna Borowska

Term 2014Z:

Joanna Karbowska-Chilińska

Term 2012Z:

Term 2013Z:

Term 2010Z:

Term 2011Z:

Bibliography

a) basic references:
1. L. Banachowski, K. Diks, W. Rytter, Algorithms and Data Structures
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to algorithms,

b) supplementary references:
1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, Designing and analyze of computer algorithms
2. A. Drozdek, D. L. Simon, Data Structures in C
3. N. Wirth, Algorithms + data structures = programs