Data Structures and Algorithms IILaajuus (4 cr)
Code: LTD7005
Credits
4 op
Teaching language
- Finnish
Responsible person
- Seppo Nevalainen
- Mikko Anttonen
Objective
After completing the course:
- Student knows how to analyse asymptotic time complexity of algorithms, including recursive algorithms.
- Student can measure and extrapolate running real time of programs.
- Student understands basic concepts of graphs, graph properties and graphs as abstract data types.
- Student understands elementary graph algorithms and is able to design, implement, and analyse simple graph algorithms.
- Student knows elementary algorithm strategies and is able to apply those.
- Student knows how to use mass storage efficiently and is 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.
Qualifications
Data Structures and Algorithms I, or similar skills.
Materials
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein: Introduction to Algorithms, 3rd Ed. The MIT Press, 2009. Lecture notes.
Enrollment
01.04.2022 - 30.04.2022
Timing
24.10.2022 - 14.12.2022
Number of ECTS credits allocated
4 op
Mode of delivery
Contact teaching
Campus
Wärtsilä Campus Karjalankatu 3
Teaching languages
- Finnish
Degree programmes
- Degree Programme in Business Information Technology
Teachers
- Mikko Anttonen
Teacher in charge
Mikko Anttonen
Groups
-
DTNS21Information Technology (BBA), Full-time Studies, Fall, 2021
Objective
After completing the course:
- Student knows how to analyse asymptotic time complexity of algorithms, including recursive algorithms.
- Student can measure and extrapolate running real time of programs.
- Student understands basic concepts of graphs, graph properties and graphs as abstract data types.
- Student understands elementary graph algorithms and is able to design, implement, and analyse simple graph algorithms.
- Student knows elementary algorithm strategies and is able to apply those.
- Student knows how to use mass storage efficiently and is 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
Qualifications
Data Structures and Algorithms I, or similar skills.
Enrollment
01.10.2021 - 31.10.2021
Timing
10.01.2022 - 18.03.2022
Number of ECTS credits allocated
4 op
Mode of delivery
Contact teaching
Campus
Wärtsilä Campus Karjalankatu 3
Teaching languages
- Finnish
Seats
1 - 60
Degree programmes
- Degree Programme in Business Information Technology
Teachers
- Mikko Anttonen
Teacher in charge
Mikko Anttonen
Groups
-
LTDNS20IInformation Technology (BBA), Full-time Studies, Fall, 2020, ICT
Objective
After completing the course:
- Student knows how to analyse asymptotic time complexity of algorithms, including recursive algorithms.
- Student can measure and extrapolate running real time of programs.
- Student understands basic concepts of graphs, graph properties and graphs as abstract data types.
- Student understands elementary graph algorithms and is able to design, implement, and analyse simple graph algorithms.
- Student knows elementary algorithm strategies and is able to apply those.
- Student knows how to use mass storage efficiently and is 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
Qualifications
Data Structures and Algorithms I, or similar skills.