ITKA201 Algorithms 1 (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, 2023-2024
Description
Content
Analysis of algorithms, asymptotic notation, determining the time complexity. Data structures, stack, queue, list, binary tree, networks. Algorithm design paradigms, brute force, divide and conquer, dynamic programming, greedy method.
Completion methods
Exam.
Assessment details
Exam. No compulsory attendance in lectures or in exercise/demo groups.
Learning outcomes
Student is able to design simple algorithms. Student is able to select suitable data structures for algorithms.
Description of prerequisites
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. 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