Data Structures and Algorithms (5 ECTS)
Code: TX00EY28-3008
General information
- Enrollment
-
05.05.2025 - 19.10.2025
Enrollment is ongoing
Enroll to the implementation in OMA
- Timing
-
20.10.2025 - 14.12.2025
The implementation has not yet started.
- Number of ECTS credits allocated
- 5 ECTS
- Mode of delivery
- On-campus
- Unit
- School of ICT and Industrial Management
- Campus
- Myllypurontie 1
- Teaching languages
- Finnish
- Seats
- 0 - 35
- Degree programmes
- Information and Communication Technology
Implementation has 8 reservations. Total duration of reservations is 24 h 0 min.
| Time | Topic | Location |
|---|---|---|
|
Tue 21.10.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
|
Tue 28.10.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
|
Tue 04.11.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
|
Tue 11.11.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
|
Tue 18.11.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
|
Tue 25.11.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
|
Tue 02.12.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
|
Tue 09.12.2025 time 09:00 - 12:00 (3 h 0 min) |
Tietorakenteet ja algoritmit TX00EY28-3008 |
MPA5020
Oppimistila
|
Objective
The student
• is familiar with the most common data structures and some of the key algorithms used in data processing
• has a practical feel for the design and computational complexity of algorithms
• is familiar with the ready-made data structure implementations offered by libraries in one of the programming languages.
Content
• Abstract data type: interface and implementation
• Iterativeness vs. recursivity
• Time and space requirements
• Linked lists
• Stack and queue
• Trees
• Graphs
• Search techniques
• Sorting algorithms
• Algorithm types
• General purpose data structure libraries (list, map, set)
Evaluation scale
0-5
Assessment criteria, satisfactory (1)
The student
• has achieved the objectives of the course to a satisfactory level
• is able to identify, define and use concepts and models in the subject area of the course
• has completed the learning tasks required for the course to the minimum standard.
Assessment criteria, good (3)
The student
• has achieved the objectives of the course well
• is able to identify, define and use concepts and models in the subject area of the course
• has completed the learning tasks of the course at a good level.
Assessment criteria, excellent (5)
The student
• has achieved the objectives of the course with excellent marks
• is able to identify, define, use and apply concepts and models in the subject area of the course in a variety of ways
• has completed the learning tasks of the course at an excellent level and has put considerable own effort into them.
Assessment criteria, approved/failed
The student
• has achieved the objectives of the course
• is able to identify, define and use concepts and models in the subject area of the course
• has completed the learning tasks required for the course.
Qualifications
Object-oriented Programming