Computation IIDF12800, 2014HT
Two lectures/exercises; approx 3h lec+2h ex each.
Important for all CUGS students, in particular those with little or no experience in constructing and analyzing algorithms.
The course was last given
To obtain a basic understanding of algorithm construction and
CUGS Computation I or similar (familiarity with the contents of chapter 1-5 in Corman et al's book; see textbook for this course)
Basic methods for constructing and analysing algorithms.
H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press (see http://www-mitpress.mit.edu)
4 HEC (Higher Education Credits)
This is a crash course version of the LiU course TDDA32 "Construction and Analysis of Algorithms" (the examination is exactly the same).
Page responsible: Director of Graduate Studies
Last updated: 2012-05-03