Data Structures and Algorithms (4cr)

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

Information about the materials are in Moodle.

Teaching methods

The study involves contact teaching and requires attendance at the SEAMK campus. The course is conducted in the Moodle learning environment. The course requires independent work and scheduling.

The recordings of the teaching sessions are not available. The student familiarizes themselves with the material and completes assignments according to the given instructions.

Completion alternatives

No alternative completion methods.

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.

4 cu * 27 h/cu = 108 hours, of which around one third is contact teaching and two thirds independent work.

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.