Computation IIDF12800, 2010HT
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).
The course is an intensive course consisting of 2-3 day sessions
(usually 2-3 sessions) at the study centre/university. The course has no
admission fee, but course participants (or the groups they belong to)
pay for travel and any food and accomodation. (For students registered
with CUGS, the research school will pay for food and accomodation.) More
information about this is available at <http://www.ida.liu.se/cugs/>
Page responsible: Director of Graduate Studies