Data Structures and Algorithms II (5 cr)
Code: DT10061-3002
General information
- Enrollment
- 01.04.2024 - 30.09.2024
- Registration for the implementation has ended.
- Timing
- 28.10.2024 - 13.12.2024
- Implementation has ended.
- Number of ECTS credits allocated
- 5 cr
- Local portion
- 5 cr
- Mode of delivery
- Blended learning
- Unit
- Tradenomi / Tietojenkäsittely (DD)
- Teaching languages
- Finnish
- Degree programmes
- Degree Programme in Business Information Technology
- Teachers
- Mikko Anttonen
- Teacher in charge
- Mikko Anttonen
- Groups
-
DTNS23Information Technology (BBA), Full-time Studies, Fall, 2023
- Course
- DT10061
Evaluation scale
H-5
Objective
- you know how to analyse asymptotic time complexity of algorithms, including recursive algorithms. You are able to measure and extrapolate running real time of programs.
- you understand basic concepts of graphs, graph properties and graphs as abstract data types.
- you understand elementary graph algorithms and you are able to design, implement, and analyse simple graph algorithms.
- you know elementary algorithm strategies and you are able to apply those.
- you know how to use mass storage efficiently and you are able to analyse running time of algorithms using mass storage.
Content
- Algorithms and running time analysis.
- Experimental time complexity analysis.
- Graphs, graph algorithms, and applying graph algorithms.
- Using mass storage efficiently.