x !
Archived Curricula Guide 2011–2012
Curricula Guide is archieved. Please refer to current Curricula Guides
TKOPA215 Data Structures 10 ECTS
Organised by
Computer Science
Person in charge
Professor Martti Juhola.
Preceding studies

Learning outcomes

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.


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


Modes of study


Numeric 1-5.

Recommended year of study

2. year autumn

Study materials

  1. Goodrich M.T., Tamassia R., Data Structures and Algorithms in Java. John Wiley & Sons 1st ed. 1998 or 2nd ed. 2001

Belongs to following study modules

School of Information Sciences
School of Information Sciences
School of Information Sciences
Complementing studies (Computer Science/Interactive Technology)
Archived Teaching Schedule. Please refer to current Teaching Shedule.
School of Information Sciences