Course Title

Computation II 

Course Type

CUGS CS Review / CUGS CS Core / CUGS CS Advanced / Other


Once every year.

Suggested # of Credits

4.0 HE Credits (Higher Education Credits)

Intended audience

Important for all CUGS students, in particular those with little or no experience in constructing and analyzing algorithms.


The primary aim of this course is to increase the student's skills in algorithmic problem solving. To this end, the course presents several techniques for design and anlysis of jalgorithms.


CUGS Computation I or similar (familiar witht the contents of chapter 1-5 in Corman et al's book; see textbook for this course)

Related courses

Computation III


Basic methods for constructing and analysing algorithms. Methods for constructing and analysing algorithms. The theory is illustrated by examples from graph algorithms, probabilistic algorithms, approximation algorithms, CSP, mathematical algorithms and the theory for NP-completeness.

Organized by

Department of Computer Science, Linköping University


Intensive course.


Written examination (2003-01-17).


  1. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press 2nd edition (see

Detailed reading list:

Read everything but concentrate on II, IV, VI, VII:28-30 and VII:34-35.


Peter Jonsson

Course homepage

This course is based on TDDA32, and more information about course content can be found at

Other information

Always consider the possibility of following the ugrad-course TDDA32 instead of CompII. The content of the courses is the same but there are more time for presenting the material and, more importantly, discussing it in TDDA32. Also note that the examination is identical.



Travel reports

Licentiate seminars


Courses Fall 2015


Last modified on July 2008 by Anne Moe