Course syllabus adopted 2021-02-26 by Head of Programme (or corresponding).
Overview
- Swedish nameAlgoritmer, fortsättningskurs
- CodeTDA251
- Credits7.5 Credits
- OwnerMPALG
- Education cycleSecond-cycle
- Main field of studyComputer Science and Engineering, Software Engineering
- DepartmentCOMPUTER SCIENCE AND ENGINEERING
- GradingTH - Pass with distinction (5), Pass with credit (4), Pass (3), Fail
Course round 1
- Teaching language English
- Application code 02116
- Maximum participants85
- Block schedule
- Open for exchange studentsYes
- Only students with the course round in the programme overview.
Credit distribution
Module | Sp1 | Sp2 | Sp3 | Sp4 | Summer | Not Sp | Examination dates |
|---|---|---|---|---|---|---|---|
| 0107 Project 7.5 c Grading: TH | 7.5 c |
In programmes
- MPALG - COMPUTER SCIENCE - ALGORITHMS, LANGUAGES AND LOGIC, MSC PROGR, Year 1 (compulsory elective)
- MPALG - COMPUTER SCIENCE - ALGORITHMS, LANGUAGES AND LOGIC, MSC PROGR, Year 2 (elective)
- MPCAS - COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Year 1 (compulsory elective)
- MPCAS - COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Year 2 (elective)
- MPCSN - COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 1 (elective)
- MPCSN - COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 2 (elective)
- MPDSC - DATA SCIENCE AND AI, MSC PROGR, Year 1 (elective)
- MPDSC - DATA SCIENCE AND AI, MSC PROGR, Year 2 (elective)
- MPSOF - SOFTWARE ENGINEERING AND TECHNOLOGY, MSC PROGR, Year 2 (elective)
- MPSYS - SYSTEMS, CONTROL AND MECHATRONICS, MSC PROGR, Year 2 (elective)
Examiner
Peter Damaschke- Full Professor, Data Science and AI, Computer Science and Engineering
Eligibility
General entry requirements for Master's level (second cycle)Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Specific entry requirements
English 6 (or by other approved means with the equivalent proficiency level)Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling the requirements above.
Course specific prerequisites
The course TIN093 Algorithms or equivalent is required.Aim
The course provides advanced techniques in the design and analysis of algorithms. It continues in the spirit of the first Algorithms course and maintains a rigorous analytical style. The course goes deeper into specialized topics in algorithms. At some points it may even touch on frontiers of current research.Learning outcomes (after completion of the course the student should be able to)
- know in more depth some important design and analysis techniques for algorithms, in particular, ways to approach NP-complete problems- to some extent be able to apply such techniques to solve new problems that may arise in various applications
- have some practice in recognizing connections between algorithmic problems and reducing them to each other
- be able to explain more complex algorithms and proofs in written form
- know selected topics of current research on algorithms
Content
- approximation algorithms and their analysis, approximation schemes,- use of linear programming, in particular for approximation,
- network flow with some complex applications,
- randomized algorithms and their analysis by appropriate random variables,
- helpful input structures like tree structures and input parameters
Organisation
Lectures and hand-in exercises.Literature
See separate literature list.Examination including compulsory elements
Exam, consisting of hand-in exercises and a final take-home exam.The course examiner may assess individual students in other ways than what is stated above if there are special reasons for doing so, for example if a student has a decision from Chalmers on educational support due to disability.