x !
Archived teaching schedules 2012–2013
You are browsing archived teaching schedule. Current teaching schedules can be found here.
TIETS09 Programming Contests 5 ECTS
Periods
Period I Period II Period III Period IV
Language of instruction
English
Type or level of studies
Advanced studies
Course unit descriptions in the curriculum
Degree Programme in Computer Sciences
School of Information Sciences

Learning outcomes

After completing the course a student is expected to

- be able to design and implement efficiently basic algorithms related to dynamic programming, graphs, numeric algorithms, optimization and geometric algorithms.

- have a deepened understanding of the fundamental role that algorithm design and analysis have in solving real problems.

- be familiar with the most common programming contests, online practise environments and literature on algorithmic programming.

General description

Note. This course continues from Spring term 2012 (periods IV-I).

Teachers

Timo Poranen, Teacher responsible

Teaching

15-May-2012 – 31-Oct-2012
Lectures
Introductory lecture
Tue 15-May-2012 at 14-16, Seminar room Pinni B1029