| TDDA32 | Design and Analysis of Algorithms, 5 ECTS credits. /Konstruktion och analys av algoritmer/ |
||
Prel. scheduled
hours: 30 |
|||
|
Area of Education: Technology Subject area: Computer Science/Computer Engineering |
|||
| Advancement level
(A-D): 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 the design and analysis of algorithms. |
|||
| Prerequisites: (valid for students admitted to programmes within which the course is offered) Discrete mathematics (e.g. TATA35) and logic (e.g. TDDB83) 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. Basic knowledge in probability theory and optimization. Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshhold requirements for progression within the programme, or corresponding. |
|||
| Supplementary courses: TDDB 45 Complexity Theory |
|||
| Organisation: The content of the course is presented during the lectures. |
|||
| Course contents: 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., Stein C.: Introduction to Algorithms: Second Edition. The MIT Press, ISBN 0-262-03293-7. |
|||
| Examination: | |||
| Written examination |
3,5 p |
||
Course language is Swedish. Department offering the course: IDA. Director of Studies: sas-sr@ida.liu.se Examiner: Peter Jonsson Link to the course homepage at the department Course Syllabus in Swedish |
|||
|
|
 |
|||||
| ||||||