| TTIT33 | Algorithms and Optimization, 10 ECTS credits. /Tema: Algoritmer och optimering/ |
||
|
Area of Education: Subject area: |
|||
| Advancement level
(A-D): B
|
|||
| Aim: Skills in mathematically modeling combinatorical optimization problems and find the complexity of these problems using complexity theory. Knowledge of well-known optimization problems and algorithms to solve them. Understanding of and skills in methods for design and analysis of algorithms. Knowledge of basic abstract data types and efficient implementations of these abstract data types. |
|||
| Prerequisites: (valid for students admitted to programmes within which the course is offered) Linear algebra, TTIT 31 Programming.A course in discrete mathematics. 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: TDDA 32 Design and Analysis of Algorithms, TAOP 19 Combinatorical Optimization, Advanced Course |
|||
| Organisation: See studiehandboken, part 1. Some parts are integrated with TTIT 36 Communication IT. |
|||
| Course contents: Basic linear programming and duality, problem classification, network problems (algorithms based on graph search), minimal spanning tree, tree search, non-optimizing algorithms (approximating algorithms and heuristics). Time complexity of algorithms, abstract data types (list, stack, queue, mapping, tree, set, dictionary, priority queue, graph) and their implementations, sorting and selection, methods for algorithm design (divide and conquer, dynamic programming, greedy algorithms). |
|||
| Course literature: See literature list. |
|||
| Examination: | |||
| Written examination Laboration course Assignment and oral examination Work in PBL-group |
4 p 2 p 0,5 p 0 p |
||
Course language is Swedish. Department offering the course: IDA. Director of Studies: Examiner: Link to the course homepage at the department Course Syllabus in Swedish |
|||
|
|
 |
|||||
| ||||||