Skip to main content

Data Structures and Algorithms (4 cr)

Code: KL00CQ12-3005

General information


Enrollment
10.11.2025 - 14.01.2026
Registration for introductions has not started yet. Registration starts :startDate
Timing
07.01.2026 - 22.02.2026
The implementation has not yet started.
Number of ECTS credits allocated
4 cr
Local portion
4 cr
Mode of delivery
Contact learning
Unit
SeAMK Automation Engineering and Information Technology
Campus
SeAMK Seinäjoki, Frami
Teaching languages
Finnish
Degree programmes
Bachelor of Engineering, Information Technology
Teachers
Petteri Mäkelä
Groups
TITE24
Bachelor of Engineering, Information Technology
Course
KL00CQ12

Evaluation scale

1-5

Objective

Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently.

Content

- Lists, stack, queue
- Dictionaries
- Trees
- Sorting
- Searching
- Hashing
- Principles of algorithm analysis
- Collection classes of C#, Java or C++

Materials

To be announced at the beginning of the course

Teaching methods

Lectures and exercises

Exam schedules

The exam is in the last lesson

Student workload

Lectures 37 %, independent studying 63 %.

Assessment criteria, satisfactory (1)

Student can implement fundamental data structures and algorithms. Student can use lists and dictionaries, and algorithms associated to them.

Assessment criteria, good (3)

Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms.

Assessment criteria, excellent (5)

Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently. Student can analyze the running time of the algorithms.

Qualifications

Basics of programming

Go back to top of page