Data Structures and Algorithms (5 cr)
Code: TX00EY28-3003
General information
- Enrollment
-
02.12.2024 - 16.03.2025
Registration for the implementation has ended.
- Timing
-
17.03.2025 - 11.05.2025
Implementation is running.
- Number of ECTS credits allocated
- 5 cr
- Local portion
- 5 cr
- Mode of delivery
- On-campus
- Unit
- (2019-2024) School of ICT
- Campus
- Myllypurontie 1
- Teaching languages
- English
- Seats
- 0 - 35
- Degree programmes
- Degree Programme in Information Technology
- Teachers
- Matti Valovirta
- Groups
-
ICT23-SWSoftware Engineering
-
tivivaihto_k25Tivi-vaihto, kevät 2025
- Course
- TX00EY28
Implementation has 7 reservations. Total duration of reservations is 21 h 0 min.
| Time | Topic | Location |
|---|---|---|
|
Wed 19.03.2025 time 13:00 - 16:00 (3 h 0 min) |
Data Structures and Algorithms TX00EY28-3003 |
MPA3018
Oppimistila
|
|
Wed 26.03.2025 time 13:00 - 16:00 (3 h 0 min) |
Data Structures and Algorithms TX00EY28-3003 |
MPA3018
Oppimistila
|
|
Wed 09.04.2025 time 13:00 - 16:00 (3 h 0 min) |
Data Structures and Algorithms TX00EY28-3003 |
MPA5023
Oppimistila
|
|
Wed 16.04.2025 time 13:00 - 16:00 (3 h 0 min) |
Data Structures and Algorithms TX00EY28-3003 |
MPA5024
Oppimistila
|
|
Wed 23.04.2025 time 13:00 - 16:00 (3 h 0 min) |
Data Structures and Algorithms TX00EY28-3003 |
MPA3018
Oppimistila
|
|
Wed 30.04.2025 time 13:00 - 16:00 (3 h 0 min) |
Data Structures and Algorithms TX00EY28-3003 |
MPA3018
Oppimistila
|
|
Wed 07.05.2025 time 13:00 - 16:00 (3 h 0 min) |
Data Structures and Algorithms TX00EY28-3003 |
MPA5026
Luentosali
|
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