Skip to main content

Data Structures and Algorithms (4cr)

Code: AE00CM74-3001

General information


Enrollment
14.11.2022 - 19.03.2023
Registration for the implementation has ended.
Timing
06.03.2023 - 30.04.2023
Implementation has ended.
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
English
Degree programmes
Bachelor of Engineering, Automation Engineering
Teachers
Raine Kauppinen
Course
AE00CM74

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++

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.

Go back to top of page