Study Guide

Objective

The student is familiar with the most common data structures and some of the key algorithms used in data processing. The student has a practical feel for the design and computational complexity of algorithms. In addition, the student is familiar with the ready-made data structure implementations offered by libraries in one of the programming languages.

Content

- Abstract data type: interface and implementation
- Iterativeness vs. recursivity
- Time and space requirements
- Linked lists
- Stack and queue
- Trees
- Graphs
- Search techniques
- Sorting algorithms
- Algorithm types
- General purpose data structure libraries (list, map, set)

Evaluation scale

Hyväksytty/Hylätty

Assessment criteria, satisfactory (1)

The student has achieved the course objectives fairly. The student will be able to identify, define and use the course subject area’s concepts and models. The student has completed the required learning exercises in minimum requirement level.

Assessment criteria, good (3)

The student has achieved the course objectives well, even though the knowledge and skills need improvement on some areas. The student has completed the required learning exercises in good or satisfactory level. The student is able to define the course concepts and models and is able to justify the analysis.

Assessment criteria, excellent (5)

The student has achieved the objectives of the course with excellent marks. The student master commendably the course subject area’s concepts and models. The student has completed the required learning exercises in good or excellent level. The student is able to make justified and fluent analysis.

Assessment criteria, approved/failed

The student has achieved the course objectives. The student will be able to identify, define and use the course subject area’s concepts and models. The student has completed the required learning exercises.

Prerequisites

Object-oriented Programming