Skip to main content

Data Structures and Algorithms (5 cr)

Code: TX00EW61-3007

General information


Enrollment
01.01.2020
Registration for the implementation has ended.
Timing
28.08.2024 - 09.10.2024
Implementation has ended.
Number of ECTS credits allocated
5 cr
Mode of delivery
On-campus
Unit
(2019-2024) School of ICT
Campus
Karaportti 2
Teaching languages
English
Seats
0 - 42
Degree programmes
Further Education Programme in Technology, Communication and Transport
Teachers
Fikadu Mulugeta
Groups
LT6724K
Industrial Management Diploma
Course
TX00EW61

Implementation has 7 reservations. Total duration of reservations is 42 h 0 min.

Time Topic Location
Wed 28.08.2024 time 10:00 - 16:00
(6 h 0 min)
Data Structures and Algorithms TX00EW61-3007
KMD758 Oppimistila
Wed 04.09.2024 time 10:00 - 16:00
(6 h 0 min)
Data Structures and Algorithms TX00EW61-3007
KME659 Oppimistila
Wed 11.09.2024 time 10:00 - 16:00
(6 h 0 min)
Data Structures and Algorithms TX00EW61-3007
KMD751 Oppimistila
Wed 18.09.2024 time 10:00 - 16:00
(6 h 0 min)
Data Structures and Algorithms TX00EW61-3007
KMD758 Oppimistila
Wed 25.09.2024 time 10:00 - 16:00
(6 h 0 min)
Data Structures and Algorithms TX00EW61-3007
KMD758 Oppimistila
Wed 02.10.2024 time 10:00 - 16:00
(6 h 0 min)
Data Structures and Algorithms TX00EW61-3007
KMD758 Oppimistila
Wed 09.10.2024 time 10:00 - 16:00
(6 h 0 min)
Data Structures and Algorithms TX00EW61-3007
KMD758 Oppimistila
Changes to reservations may be possible.

Objective

The student is familiar with the most common data structures and some of the key algorithms used in data processing. The student has a practical feel for the design and computational complexity of algorithms. In addition, the student 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 course objectives fairly. The student will be able to identify, define and use the course subject area’s concepts and models. The student has completed the required learning exercises in minimum requirement level.

Assessment criteria, good (3)

The student has achieved the course objectives well, even though the knowledge and skills need improvement on some areas. The student has completed the required learning exercises in good or satisfactory level. The student is able to define the course concepts and models and is able to justify the analysis.

Assessment criteria, excellent (5)

The student has achieved the objectives of the course with excellent marks. The student master commendably the course subject area’s concepts and models. The student has completed the required learning exercises in good or excellent level. The student is able to make justified and fluent analysis.

Assessment criteria, approved/failed

The student has achieved the course objectives. The student will be able to identify, define and use the course subject area’s concepts and models. The student has completed the required learning exercises.

Qualifications

C++ Programming, Game Mathematics.

Go back to top of page