TIEA211 Algorithms 2 (4 cr)
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.
Exam and assignment.
Exam and assignment. No compulsory attendance in lectures or in exercise/demo groups.
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.
- Cormen, Leiserson, Rivest, Stein, "Introduction to Algorithms".
- Goodrich, Tamassia, Goldwasser, "Data Structures and Algorithms in Java".
- Weiss, "Data Structures and Algorithm Analysis in Java".