course-details-portlet

TDT4120 - Algorithms and Data Structures

About

Examination arrangement

Examination arrangement: Written examination
Grade: Letters

Evaluation Weighting Duration Grade deviation Examination aids
Written examination 100/100 4 timer

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, maximal flow and optimal circulation in networks. Methods for searching in text. Theory of problem complexity. Algorithms are expressed in a language independent fashion.

Learning outcome

To give the students a solid foundation in a broad spectrum of established algorithms with usefulness in several areas of application. The students should be able to analyse the efficiency of algorithms in order to find the best possible solution to aproblem, and they will be given training in how problems are best formulated in order to be handled in a rational manner by an algorithm. Furthermore, the students will learn how to use known algorithms and existing program modules on new problems, as well as how to develop and implement new solutions for complex problems with a basis in a practical reality.

Learning methods and activities

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

Compulsory assignments

  • Exercises

Course materials

Cormen, Leiserson, Rivest: Introduction to Algorithms, The MIT Press. (This may change.)

Credit reductions

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

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

Coursework

Term no.: 1
Teaching semester:  AUTUMN 2011

Language of instruction: -

-

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

Department with academic responsibility
Department of Computer Science

Examination

Examination arrangement: Written examination

Term Status code Evaluation Weighting Examination aids Date Time Examination system Room *
Autumn ORD Written examination 100/100 2011-12-14 15:00
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.
Examination

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

More on examinations at NTNU