Course
Algorithm Theory (DAT600)
This course is about algorithm theory and complexity theory, which includes the following topics: Graphs and graph algorithms, greedy algorithms, dynamic programming, linear programming, and NP-completeness.
Dette er emnebeskrivelsen for studieåret 2018-2019. Merk at det kan komme endringer.
Semesters
Fakta
Emnekode
DAT600
Vekting (stp)
10
Semester undervisningsstart
Autumn
Undervisningsspråk
English
Antall semestre
1
Vurderingssemester
Autumn
Timeplan
Content
Introduction to algorithm theory and complexity theory; Sorting and order statistics, datastructures , advanced design and analysis techniques, graphs and graph algorithms, multithreaded algorithms, NP-completeness.
Learning outcome
After completing this course the student should be able to:
- Understand what algorithms and datastructures mean for developing lage and complex information systems
- Create efficient algorithms, in terms of time, and resource like memory
- Choose and apply different types of algorithms depending on what the information systems demand
- Choose the optimal algorithms among many competing ones
Forkunnskapskrav
Ingen
Anbefalte forkunnskaper
Algorithms and Datastructures (DAT200)
Exam
| Form of assessment | Weight | Duration | Marks | Aid | Exam system | Withdrawal deadline | Exam date |
|---|---|---|---|---|---|---|---|
| Written exam | 1/1 | 4 Hours | Letter grades | No printed or written materials are allowed. Approved basic calculator allowed | Inspera assessment | — | — |
Vilkår for å gå opp til eksamen/vurdering
Compulsory assignments
4 compulsory assignments.
Fagperson(er)
Course coordinator:
Nejm SaadallahHead of Department:
Tom RyenMethod of work
4 hours lectures and 2 hours exercises.
Åpent for
Master studies at the Faculty of Science and Technology
Emneevaluering
Form and/or discussion.
Litteratur
Cormen et al, "Introduction to Algorithms", MIT Press, 2009
(about 500 pages)
Additional notes (about 100 side)
The course description is retrieved from FS (Felles studentsystem). Version 1