x !
Archived Curricula Guide 2012–2015
Curricula Guide is archieved. Please refer to current Curricula Guides
TIETS09 Programming Contests 5 ECTS
Organised by
Degree Programme in Computer Sciences
Preceding studies
Recommended:

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.

Contents

Programming contests, algorithmic programming, dynamic programming, graph algorithms, numeric algoritms, optimization, geometric algorithms.

Further information on prerequisites and recommendations

Recommended year of study 3rd year or later.

Teaching methods

Teaching method Contact Online
Lectures
Group work

2 hours lectures, 4-8 hours seminar work, participation in a programming contest.

Teaching language

English

Modes of study

Option 1
Available for:
  • Degree Programme Students
  • Other Students
  • Open University Students
  • Doctoral Students
  • Exchange Students
Project / practical work 
In English

Seminar, exercises, participation in a programming contest.

Evaluation

Pass/fail.

Study materials

See the course web page.

Belongs to following study modules

2015–2016
Teaching
Archived Teaching Schedule. Please refer to current Teaching Shedule.
-
School of Information Sciences