TIEA211 Algorithms 2 (4 cr)

Study level:
Intermediate studies
Grading scale:
0-5
Language:
Finnish
Responsible organisation:
Faculty of Information Technology
Curriculum periods:
2017-2018, 2018-2019, 2019-2020

Description

Content

Algorithm analysis, priority queue, hashing, trees, sets, recursion, divide and conquer, greedy method, dynamic programming, backtracking, branch and bound, local search, heuristics, NP-completeness.

Completion methods

Examination and assignment.

Assessment details

Examination and assignment. No compulsory attendance in lectures or in exercises.

Learning outcomes

Student is able to apply algorithm design methods. Student is able to select suitable data structures for algorithms. Student is able to analyze the time complexity of simple algorithms.

Description of prerequisites

ITKP102 Programming 1, ITKA201 Algorithms 1.

Study materials

Cormen, Leiserson, Rivest, Stein, "Introduction to Algorithms". Weiss, "Data Structures and Algorithm Analysis in Java". Goodrich, Tamassia, Goldwasser, "Data Structures and Algorithms in Java".

Completion methods

Method 1

Select all marked parts
Parts of the completion methods
x

Teaching (4 cr)

Type:
Participation in teaching
Grading scale:
0-5
Language:
Finnish

Teaching