Search programme

​Use the search function to search amongst programmes at Chalmers. The study programme and the study programme syllabus relating to your studies are generally from the academic year you began your studies.

Syllabus for

Academic year
TDA251 - Algorithms, advanced course
Algoritmer, fortsättningskurs
 
Syllabus adopted 2017-02-20 by Head of Programme (or corresponding)
Owner: MPALG
7,5 Credits
Grading: TH - Five, Four, Three, Fail
Education cycle: Second-cycle
Major subject: Computer Science and Engineering, Information Technology
Department: 37 - COMPUTER SCIENCE AND ENGINEERING

Remaining seats for MPALG1- and MPCAS1-students. Contact elke.mangelsen@chalmers.se for queue list.
Teaching language: English
Open for exchange students: Yes
Block schedule: C
Maximum participants: 80

Course elements   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0107 Project 7,5c Grading: TH   7,5c    

In programs

MPCSN COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 2 (elective)
MPCSN COMPUTER SYSTEMS AND NETWORKS, MSC PROGR, Year 1 (elective)
MPSOF SOFTWARE ENGINEERING AND TECHNOLOGY, MSC PROGR, Year 2 (elective)
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 2 (elective)
MPCAS COMPLEX ADAPTIVE SYSTEMS, MSC PROGR, Year 1 (compulsory elective)
MPSYS SYSTEMS, CONTROL AND MECHATRONICS, MSC PROGR, Year 2 (elective)

Examiner:

Peter Damaschke

Replaces

TDA250   Algorithms, advanced course


  Go to Course Homepage

 

Eligibility:


In order to be eligible for a second cycle course the applicant needs to fulfil the general and specific entry requirements of the programme that owns the course. (If the second cycle course is owned by a first cycle programme, second cycle entry requirements apply.)
Exemption from the eligibility requirement: Applicants enrolled in a programme at Chalmers where the course is included in the study programme are exempted from fulfilling these requirements.

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.


Published: Fri 18 Dec 2009. Modified: Mon 28 Nov 2016