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 2023-2024. 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
Litteratur
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
Admission to Single Courses at the Faculty of Science and Technology
Computer Science - Master of Science Degree Programme
Industrial Automation and Signal Processing - Master's Degree Programme - 5 year
Exchange programme at Faculty of Science and Technology
Emneevaluering
There must be an early dialogue between the course supervisor, the student union representative and the students. The purpose is feedback from the students for changes and adjustments in the course for the current semester.In addition, a digital subject evaluation must be carried out at least every three years. Its purpose is to gather the students experiences with the course.
Litteratur
E-book Introduction to algorithms Cormen, T.H. et al., Cambridge, Massachusetts, MIT Press, 1313 p., 2009, isbn:1-62870-913-8; 0-262-53305-7; 0-262-25810-2; 9780262270830, https://bibsys-ur.userservices.exlibrisgroup.com/view/uresolver/47BIBSYS_UBIS/openurl?ctx_enc=info:ofi/enc:UTF-8&ctx_id=10_1&ctx_tim=2019-11-25T09%3A07%3A11IST&ctx_ver=Z39.88-2004&url_ctx_fmt=info:ofi/fmt:kev:mtx:ctx&url_ver=Z39.88-2004&rfr_id=info:sid/primo.exlibrisgroup.com-BIBSYS_ILS&req_id=&rft_dat=ie=47BIBSYS_UBIS:5135981910002208,ie=47BIBSYS_UBB:51111563820002207,ie=47BIBSYS_UBTO:5193343600002205,ie=47BIBSYS_NHHB:5153676000002216,ie=47BIBSYS_UBIN:5137172840002211,ie=47BIBSYS_NB:51246986750002202,ie=47BIBSYS_NTNU_UB:51232824250002203,ie=47BIBSYS_HIB:5133246790002221,ie=47BIBSYS_HVO:5136445630002220,ie=47BIBSYS_HIO:5164273580002218,ie=47BIBSYS_HIT:5133966370002210,ie=47BIBSYS_HIOA:5156904370002212,ie=47BIBSYS_HIM:5132207320002223,ie=47BIBSYS_HH:5144072380002214,ie=47BIBSYS_BI:5170910880002215,ie=47BIBSYS_NETWORK:71520040830002201,language=eng,view=UBIS&svc_dat=viewit&u.ignore_date_coverage=true&user_ip=10.16.56.140&req.skin=primoView online
The course description is retrieved from FS (Felles studentsystem). Version 1