| studiehandbok@lith | |
|
|
|
|
|
| TDDA32 | Design and Analysis of Algorithms, 3,5 p (sw) /Konstruktion och analys av algoritmer/ Advancement level: D | |
| Aim: 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 algorithms.Prerequisites: An introductory course on data structures and algorithms, e.g. TDDB 57 "Data Structures and Algorithms". That is, the student is expected to be familiar with asymptotic notation, basic data structures, such as lists, stacks, queues, trees etc., and algorithms for fundamental problems, such as searching, sorting, etc. Basiz knowledge in probability theory and optimization.Supplementary courses: TDDB 45 Complexity TheoryCourse organization: The content of the course is presented during the lectures. Course content: 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.Course literature: Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press. | ||
| |
|
|
 |
|||||
|
|
||||||
