OHJ-2016 Utilization of Data Structures, I & II 2012
20.08.2012 Pages updated for the 2012 autumn course!
tut.ot.tiraka
Main
Grading
Exercises
Homework
Lectures
Material
Restrictions
Exams

Printable version
Page map

Introduction

The course is a 5-credit-unit course that focuses on data structures and algorithms commonly used in programming. The main emphasis is in understanding the behaviour and efficiency of algorithms and the data structures they're applied to. Attention in also payed to choosing the suitable data structure in a given situation.

Prerequisites:

Sufficient programming skills are required. There are two prerequisite programming courses: OHJ-1106 Programming I and OHJ-1156 Programming II. In addition, a basic knowledge in mathematics for Algorithms is expected.

This course is identical in content with the version of the course lectured in Finnish: Tietorakenteiden käyttö. The course is primarily targeted to international students, but Finnish students are encouraged to participate as well.

Objectives

After completing the course, the students are able to:
  • name the most common sorting algorithms and to implement them in a programming language.
  • recognise basic data stuctures and the algorithms needed to handle them
  • choose a suitable data structure for implementing a feature
  • explain the basis of asymptotic algorithm analysis and evaluate the time and memory consumption of simple programs.
  • explain the advantages and limitations of library implementations in different languages

The course is a two-period course consisting of lectures, exercises, programming assignments, and an exam. Grading is based on a written exam and the compulsory programming assignments and byTheMark-exercises, out of which at least 60% of the points needs to be collected.

Last updated 29.08.2011 12:30 - terhi.kilamo@tut.fi