TDT4120 - Algorithms and Data Structures


Examination arrangement

Examination arrangement: Written examination
Grade: Letters

Evaluation form Weighting Duration Examination aids Grade deviation
Written examination 100/100 4 hours D

Course content

Methods for analysing the efficiency of algorithms, divide and conquer techniques, recursive solution methods. Methods for ordering, searching and sorting. Data structures for efficient retrieval of data, dynamic programming and greedy algorithms. Data structures for implementing graphs and networks, as well as methods for traversals and searches. Algorithms for finding the best path(s) and matchings, spanning trees and maximum flow. Theory of problem complexity. Algorithms are expressed in a language-independent manner.

Learning outcome

Knowledge – the candidate should have knowledge about:
- A broad spectrum of established algorithms that are useful in several areas of application.
- Classical algorithmic problems with known efficient solutions.
- Complex problems without known efficient solutions.

Skills – the candidate should be able to:
- Analyze the efficiency of an algorithm to achieve good solutions for a given problem.
- Formulate a problem so it can be handled in a rational manner by an algorithm.
- Use well-known design methods to construct new efficient algorithms.

General competence – the candidate should be able to:
- Use well-known algorithms and available program modules on new problems.
- Develop and implement new solutions for complex problems with a basis in practical reality.

Learning methods and activities

Lectures and individual exercises.

Compulsory assignments

  • Exercises

Further on evaluation

If there is a re-sit examination, the examination form may change from written to oral.

Specific conditions

Exam registration requires that class registration is approved in the same semester. Compulsory activities from previous semester may be approved by the department.

Course materials

Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, third edition. (This may change.)

Credit reductions

Course code Reduction From To
SIF8010 7.5
IT1105 7.5
MNFIT115 7.5
MNFIT112 7.5
IDATA2302 7.5
More on the course

Version: 1
Credits:  7.5 SP
Study level: Intermediate course, level II


Term no.: 1
Teaching semester:  AUTUMN 2019

No.of lecture hours: 2
Lab hours: 3
No.of specialization hours: 7

Language of instruction: Norwegian

Location: Ålesund , Trondheim

Subject area(s)
  • Technological subjects
Contact information
Course coordinator: Lecturer(s):

Department with academic responsibility
Department of Computer Science



Examination arrangement: Written examination

Term Status code Evaluation form Weighting Examination aids Date Time Digital exam Room *
Autumn ORD Written examination 100/100 D 2019-11-28 09:00 INSPERA
Room Building Number of candidates
C220 Hovedbygget 3
SL321 Sluppenvegen 14 1
SL110 hvit sone Sluppenvegen 14 64
SL110 lilla sone Sluppenvegen 14 64
SL111 grønn sone Sluppenvegen 14 50
SL111 brun sone Sluppenvegen 14 82
SL111 orange sone Sluppenvegen 14 60
SL111 lyseblå sone Sluppenvegen 14 82
SL111 blå sone Sluppenvegen 14 52
SL120 blå sone Sluppenvegen 14 34
SL310 blå sone Sluppenvegen 14 48
SL310 lilla sone Sluppenvegen 14 80
SL310 hvit sone Sluppenvegen 14 46
SL311 grønn sone Sluppenvegen 14 68
SL311 brun sone Sluppenvegen 14 81
SL311 orange sone Sluppenvegen 14 64
SL120 orange sone Sluppenvegen 14 15
SL317 Sluppenvegen 14 1
SL315 Sluppenvegen 14 4
SL318 Sluppenvegen 14 1
SL319 Sluppenvegen 14 1
SL110 turkis sone Sluppenvegen 14 80
Summer UTS Written examination 100/100 D INSPERA
Room Building Number of candidates
  • * The location (room) for a written examination is published 3 days before examination date. If more than one room is listed, you will find your room at Studentweb.

For more information regarding registration for examination and examination procedures, see "Innsida - Exams"

More on examinations at NTNU