Data structures and algorithmsLaajuus (5 cr)
Code: OT00EK02
Credits
5 op
Objective
You know how to analyze time and space requirements for algorithms, and choose a suitable algorithm for a given problem.
You know the classic algorithms: Queue, stack, and list.
You know different sorting algorithms.
You can implement classic algorithms using a programming language.
Content
How to measure the performance of an algorithm?
How do search trees, lists and hash tables work?
What is dynamic programming and recursion?
How to solve graph and shortest path problems? What does optimization and search for optimal solution mean?
Enrollment
08.04.2024 - 21.04.2024
Timing
01.08.2024 - 31.12.2024
Number of ECTS credits allocated
5 op
Mode of delivery
Contact teaching
Unit
Department of Information Technology
Campus
Mikkeli Campus
Teaching languages
- Finnish
Degree programmes
- Degree programme in software engineering
Teachers
- Ville Kauppi
Groups
-
OTMI23SPSoftware Engineering, full-time studies
Objective
You know how to analyze time and space requirements for algorithms, and choose a suitable algorithm for a given problem.
You know the classic algorithms: Queue, stack, and list.
You know different sorting algorithms.
You can implement classic algorithms using a programming language.
Content
How to measure the performance of an algorithm?
How do search trees, lists and hash tables work?
What is dynamic programming and recursion?
How to solve graph and shortest path problems? What does optimization and search for optimal solution mean?
Evaluation scale
1-5
Enrollment
06.04.2023 - 21.04.2023
Timing
01.08.2023 - 31.12.2023
Number of ECTS credits allocated
5 op
Mode of delivery
Contact teaching
Unit
Department of Information Technology
Campus
Mikkeli Campus
Teaching languages
- Finnish
Seats
1 - 40
Degree programmes
- Degree programme in software engineering
Teachers
- Jari Kortelainen
Groups
-
OTMI22SPSoftware Engineering, full-time studies
Objective
You know how to analyze time and space requirements for algorithms, and choose a suitable algorithm for a given problem.
You know the classic algorithms: Queue, stack, and list.
You know different sorting algorithms.
You can implement classic algorithms using a programming language.
Content
How to measure the performance of an algorithm?
How do search trees, lists and hash tables work?
What is dynamic programming and recursion?
How to solve graph and shortest path problems? What does optimization and search for optimal solution mean?
Opiskelumateriaali
To be settled at the course kick off.
Yksilölliset oppimisväylät
Scheduled track:
You participate in lectures and exercises according to the weekly schedule.
Independent track:
You can show your competence e.g. by a certificate. To be settled at the course kick off.
TKI ja työelämäyhteistyö
To be settled later on.
Tentit ja muut määräajat
To be settled later on.
Opiskelijan työmäärä
135 h
Evaluation scale
1-5
Assessment methods and criteria
To be settled at the course kick off.
Enrollment
06.04.2022 - 22.04.2022
Timing
31.10.2022 - 15.01.2023
Number of ECTS credits allocated
5 op
Mode of delivery
Contact teaching
Unit
Department of Information Technology
Campus
Mikkeli Campus
Teaching languages
- Finnish
Seats
10 - 40
Degree programmes
- Degree programme in software engineering
Teachers
- Jari Kortelainen
Teacher in charge
Jari Kortelainen
Groups
-
OTMI21SPSoftware Engineering, full-time studies
Objective
You know how to analyze time and space requirements for algorithms, and choose a suitable algorithm for a given problem.
You know the classic algorithms: Queue, stack, and list.
You know different sorting algorithms.
You can implement classic algorithms using a programming language.
Content
How to measure the performance of an algorithm?
How do search trees, lists and hash tables work?
What is dynamic programming and recursion?
How to solve graph and shortest path problems? What does optimization and search for optimal solution mean?
Opiskelumateriaali
To be settled at the course kick off.
Yksilölliset oppimisväylät
Scheduled track:
You participate in lectures and exercises according to the weekly schedule.
Independent track:
You can show your competence e.g. by a certificate. To be settled at the course kick off.
TKI ja työelämäyhteistyö
To be settled later on.
Tentit ja muut määräajat
To be settled later on.
Opiskelijan työmäärä
135 h
Evaluation scale
1-5
Assessment methods and criteria
To be settled at the course kick off.