Course

Algorithm Theory (DAT600)


Dette er emnebeskrivelsen for studieåret 2013-2014. Merk at det kan komme endringer.

See course description and exam/assesment information for this semester (2024-2025)

Semesters

Fakta

Emnekode

DAT600

Vekting (stp)

10

Semester undervisningsstart

Autumn

Undervisningsspråk

English

Antall semestre

1

Vurderingssemester

Autumn

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 means 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 what the information systems demand

* Choose the optimal algorithms among many competing ones

Forkunnskapskrav

Ingen

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 01.04.2013 05.06.2013


Vilkår for å gå opp til eksamen/vurdering

Compulsory assignments

Fagperson(er)

Course coordinator:

Nejm Saadallah

Head of Department:

Tom Ryen

Method of work

4 hours lectures and 2 hours exercises.

Lecture are given in English.

Å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

Through forms for student evaluation and/or discussions with the students, following the standard guidelines.

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