FDA128 Computation II (CUGS)

Lectures:

Två heldagar.

Recommended for

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

The Course was last given

2001.

Prerequisites

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

Organization

Intensive course.

Contents

Basic methods for constructing and analysing algorithms. The theory is illustrated by examples from graph algorithms, approximation algorithms and probabilistic algorithms.

Literature

1.H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press (see http://www-mitpress.mit.edu).

Detailed reading list:
Read everything but concentrate on II, IV, VI, VII:31-33 and VII:35-37.

Teachers

Peter Jonsson.

Examiner

Peter Jonsson.

Schedule

Fall 2002.

Examination

Written examination.

Credit

2,5 credits.

Comments

This course is based on TDDA32, and more information about course content can be found at http://www.ida.liu.se/~TDDA32/.