TIEA211 Algorithms 2 (4 cr)
Study level:
Intermediate studies
Grading scale:
0-5
Language:
English, Finnish
Responsible organisation:
Faculty of Information Technology
Curriculum periods:
2020-2021, 2021-2022, 2022-2023
Description
Content
Analysis of algorithms. Data structures, priority queue, heap, hashing, trees, sets. Algorithm design paradigms, recursion, divide and conquer, greedy method, dynamic programming, backtracking, branch and bound, heuristics. Computational complexity, NP-completeness.
Completion methods
Exam and assignment.
Assessment details
Exam and assignment. No compulsory attendance in lectures or in exercise/demo groups.
Learning outcomes
Student is able to apply algorithm design paradigms. Student is able to select suitable data structures for algorithms. Student is able to analyze the time complexity of simple algorithms.
Description of prerequisites
ITKA201 Algorithms 1 or equivalent knowledge. ITKP102 Programming 1 or equivalent programming skills.
Literature
- Cormen, Leiserson, Rivest, Stein, "Introduction to Algorithms".
- Goodrich, Tamassia, Goldwasser, "Data Structures and Algorithms in Java".
- Weiss, "Data Structures and Algorithm Analysis in Java".
Completion methods
Method 1
Evaluation criteria:
Exam and assignment. No compulsory attendance in lectures or in exercise/demo groups.
Select all marked parts
Parts of the completion methods
x
Teaching (4 cr)
Type:
Participation in teaching
Grading scale:
0-5
Language:
English, Finnish