Course unit, curriculum year 2025–2026
COMP.CS.350
Data Structures and Algorithms 2, 5 cr
Tampere University
- Description
- Completion options
Teaching periods
Active in period 4 (2.3.2026–31.5.2026)
Course code
COMP.CS.350Language of instruction
EnglishAcademic years
2024–2025, 2025–2026, 2026–2027Level of study
Advanced studiesGrading scale
General scale, 0-5Persons responsible
Responsible teacher:
Heikki HyyröResponsible organisation
Faculty of Information Technology and Communication Sciences 100 %
Coordinating organisation
Computing Sciences Studies 100 %
The course covers e.g.:
- Computing a minimum spanning tree of a graph.
- FInding a shortest path in a graph that may contain negative edge weights.
- Finding a cycle in a graph.
- Computing graph flow.
- Sorting strings efficiently.
- Searching one or more strings efficiently.
- Matching a regular expression with an automaton.
- Approximate string comparison (longest common subsequence; edit distance).
The course is programming-oriented: almost all introduced algorithms will be implemented in programming exercise tasks.
Learning outcomes
Prerequisites
Recommended prerequisites
Learning material
Kokonaisuudet, joihin opintojakso kuuluu
Completion option 1
The course implementation consists of lectures, exercise tasks and a final exam. The course is taught in English.
Participation in teaching
02.03.2026 – 31.05.2026
Active in period 4 (2.3.2026–31.5.2026)