The course aims at acquainting students with the principles of data structures, algorithms used with them, and abstract data types to be implemented with them.
Contents
Abstract data types, computing performance analysis, recursion, sorting, linear data structures (lists, queues, stacks), trees, binary search trees and heaps, network data structures, graphs (divertex, unweighted, weighted), shortest path algorithms, minimum spanning trees, hashing, strings, regular expressions, finite state automata, and principles of algorithm design.
Teaching methods
Teaching method
Contact
Online
Lectures
50 h
0 h
Exercises
26 h
0 h
Teaching language
Finnish
Modes of study
Option
1
Available for:
Degree Programme Students
Other Students
Open University Students
Doctoral Students
Exchange Students
Participation in course work
In
Finnish
Further information
Osallistuminen opetukseen, viikkoharjoitukset ja harjoitustyö sekä tentti.
Option
2
Available for:
Degree Programme Students
Other Students
Open University Students
Doctoral Students
Exchange Students
Weekly excercises and project workExercise(s)
In
English
examWritten exam
In
English
Written exam and weekly exercises and project work. It is possible to take this course in English provided that a student independently reads the certain parts of the course book (the lectures are in Finnish).
Evaluation
Numeric 1-5.
Study materials
Goodrich M.T., Tamassia R., Data Structures and Algorithms in Java. John Wiley & Sons 1st ed. 1998 or 2nd ed. 2001.