Data Structures and Algorithms (4cr)
Code: KL00CQ12-3005
General information
- Enrollment
- 10.11.2025 - 14.01.2026
- Registration for introductions has not started yet.
- 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ä
- Scheduling groups
- Avoin AMK (Ei koske tutkinto-opiskelijaa) (Size: 3 . Open UAS : 3.)
- Groups
-
TITE24Bachelor of Engineering, Information Technology
- Small groups
- Open UAS (Doesn't apply to degree student)
- Course
- KL00CQ12
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++
Location and time
The schedules can be found in the timetable at https://lukkarikone.seamk.fi/. Timetables are published for the next six weeks. The first six weeks of autumn are published by Midsummer and the first six weeks of spring by Christmas. Timetables may be subject to changes.
Materials
Lecture notes and other material to be announced
Teaching methods
The study involves contact teaching and requires attendance at the SEAMK campus. You have to attend 70 % of lessons.
The course also includes independent work online.
Completion alternatives
There are no alternative completion methods for the course.
Student workload
The workload of the study is designed so that one credit corresponds to an average of 27 hours of student work to achieve the learning objectives. The actual time required varies individually, e.g., due to prior knowledge.
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