Hide menu

Computation II

DF12800, 2011HT

Status Cancelled
School National Graduate School in Computer Science (CUGS)
Division SAS
Owner Peter Jonsson

  Log in  




Course plan

Lectures

Two lectures/exercises; approx 3h lec+2h ex each.

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

2010

Goals

To obtain a basic understanding of algorithm construction and
algorithm analysis

Prerequisites

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

Contents

Basic methods for constructing and analysing algorithms.

Organization

Intensive course: two 6h sessions.

Literature

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

Lecturers

Peter Jonsson

Examiner

Peter Jonsson

Examination

Written examination.

Credit

4 HEC (Higher Education Credits)

Comments

This is a crash course version of the LiU course TDDD20 "Construction and Analysis of Algorithms" (the examination is exactly the same).


Page responsible: Webmaster
Last updated: 2012-05-03