Skip to main content

Data Structures and Algorithms (5cr)

Code: 5051128-3012

General information


Enrollment
01.12.2024 - 14.01.2025
Registration for the implementation has ended.
Timing
14.01.2025 - 30.04.2025
Implementation has ended.
Number of ECTS credits allocated
5 cr
Local portion
5 cr
Mode of delivery
Contact learning
Unit
Engineering and Business
Campus
Kupittaa Campus
Teaching languages
English
Seats
0 - 45
Teachers
Laura Järvenpää
Groups
PTIVIS23H
Health Technology
Course
5051128

Realization has 24 reservations. Total duration of reservations is 48 h 0 min.

Time Topic Location
Tue 21.01.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_B1032_Beta BETA
Tue 21.01.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 28.01.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
Online
Tue 28.01.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C2027 IT-tila - telakka
Tue 04.02.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_B1032_Beta BETA
Tue 04.02.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 11.02.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
LEM_A173_Lemminkäinen Lemminkäinen
Tue 11.02.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 25.02.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_B1032_Beta BETA
Tue 25.02.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C2027 IT-tila - telakka
Tue 04.03.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
LEM_A173_Lemminkäinen Lemminkäinen
Tue 04.03.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 11.03.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_C1035_Delta DELTA
Tue 11.03.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 18.03.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_C1027_Lambda LAMBDA
Tue 18.03.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 25.03.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_C1027_Lambda LAMBDA
Tue 25.03.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C2027 IT-tila - telakka
Tue 01.04.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_B1026_Gamma GAMMA
Tue 01.04.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 08.04.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_C1027_Lambda LAMBDA
Tue 08.04.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_C3036 Cyberlab / BYOD
Tue 15.04.2025 time 08:00 - 10:00
(2 h 0 min)
Teoria, Tietorakenteet ja algoritmit 5051128-3011
ICT_B1032_Beta BETA
Tue 15.04.2025 time 10:00 - 12:00
(2 h 0 min)
Demonstration, Data Structures and Algorithms 5051128-3012
ICT_B1038 IT-tila - telakka
Changes to reservations may be possible.

Evaluation scale

H-5

Content scheduling

January and February: Algorithms and algorithmic thinking
• pseudocode, flowcharts
• efficiency and algorithmic complexity
• Sorting algorithms: Bubble, Selection, Insertion, Merge and Quick Sort

March and April: Data Structures and their algorithms
• Arrays, Linked List, Stack, Queue
• Hash table, Trees, Graphs

Contact hours according to lukkari.turkuamk.fi.

Objective

After completing the course the student can:
- explain the most common data structures
- apply the most common data structures and algorithms connected to the use of these structures
- evaluate the efficiency of algorithms.

Content

- lists, stacks, queues, trees, graphs and hash tables
- analysing and evaluating algorithms   
- designing algorithms       
- sorting methods  
- search algorithms

Materials

Material available via the learning environment (ITS).

Teaching methods

Weekly contact 3 hours sessions for theory and practical exercises.

Exam schedules

No exam, and retake not possible after evaluation grade is published.

Pedagogic approaches and sustainable development

The course has 12 three-hour contact sessions where teacher present theory and examples and students work with practical tasks. Additionally there is course introduction lecture and one theory lecture without exercises.

Electronic materials are used in the course. In addition, guidance is also organized online in order to reduce the carbon footprint caused by movement.

Completion alternatives

Not possible

Student workload

Contact hours
- Course introduction: 2 hours
- 13 times 2h theory: 13 x 2h = 26 hours
- 12 times 1h demo 12 x 1h = 12 hours - Group 1
- 12 times 1h demo 12 x 1h = 12 hours - - Group 2

Home work:
- Working with assignments: approximately 80 hours



Total: approximately 130 hours

Evaluation methods and criteria

The course is graded on a scale of 0-5.

You can achieve 80 points from practical exercises in class room and home work exercises.
Around half of the exercises are done during the contact hours.

Demonstrations of exercises during the contact session is mandatory without demonstration you will lose 50% of your marks.

Additionally, there is a group project of 20 points, passing group project is mandatory to pass the course.

Lastly, to pass the course the student need to get at least 40 marks in the exercises and at least 10 marks in the project.

Failed (0)

Less than 50% points in the exercises OR Student does not passed the group project.

Assessment criteria, satisfactory (1-2)

50 points -> 1
60 points -> 2

Assessment criteria, good (3-4)

70 points -> 3
80 points -> 4

Assessment criteria, excellent (5)

90 points -> 5

Qualifications

Introduction to Programming, or equivalent programming skills

Further information

ITS and Teams.

Go back to top of page