Data Structures and Algorithms IILaajuus (5 cr)
Code: DT10061
Credits
5 op
Teaching language
- Finnish
Responsible person
- Seppo Nevalainen
- Mikko Anttonen
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.
Further information
Prerequisites : Data Structures and Algorithms I, or similar skills.
Enrollment
01.04.2024 - 30.04.2024
Timing
28.10.2024 - 13.12.2024
Number of ECTS credits allocated
5 op
Mode of delivery
Contact teaching
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
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.
Evaluation scale
H-5
Further information
Prerequisites : Data Structures and Algorithms I, or similar skills.
Enrollment
01.04.2023 - 15.04.2023
Timing
23.10.2023 - 11.12.2023
Number of ECTS credits allocated
5 op
Virtual portion
5 op
Mode of delivery
Distance learning
Campus
Wärtsilä Campus Karjalankatu 3
Teaching languages
- Finnish
Seats
1 - 100
Degree programmes
- Degree Programme in Business Information Technology
Teachers
- Mikko Anttonen
Teacher in charge
Mikko Anttonen
Groups
-
DTNS22Information Technology (BBA), Full-time Studies, Fall, 2022
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.
Evaluation scale
H-5
Further information
Prerequisites : Data Structures and Algorithms I, or similar skills.