Course - Algorithms and Data Structures - TDT4120
TDT4120 - Algorithms and Data Structures
Examination arrangement: School exam
Grade: Letter grades
|Evaluation||Weighting||Duration||Grade deviation||Examination aids|
|School exam||100/100||4 hours||E|
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.
Students without access to the course may instead take TDT4121 Introduction to algorithms, which is equivalent as a basis for later courses, and is aimed toward programs that do not have computer science as part of their core.
Knowledge: The candidate should have knowledge about (1) a broad spectrum of established algorithms that are useful in several areas of application, (2) classical algorithmic problems with known efficient solutions, and (3) complex problems without known efficient solutions.
Skills: The candidate should be able to (1) analyze the efficiency of an algorithm to achieve good solutions for a given problem, (2) formulate a problem so it can be handled in a rational manner by an algorithm, and (3) use well-known design methods to construct new efficient algorithms.
General competence: The candidate should be able to (1) use well-known algorithms and available program modules on new problems, and (2) develop and implement new solutions for complex problems with a basis in practical reality.
Learning methods and activities
Lectures and individual exercises.
Further on evaluation
If there is a re-sit examination, the examination form may change from written to oral.
Admission to a programme of study is required:
Applied Physics and Mathematics (MTFYMA)
Computer Science (MTDT)
Cyber Security and Data Communication (MTKOM)
Cybernetics and Robotics (MTTK)
Electrification and Digitalisation (BELDIG)
Electrification and Digitalisation (BIELDIG)
Engineering and ICT (MTING)
Industrial Economics and Technology Management (MTIØT)
Natural Science with Teacher Education, years 8 - 13 (MLREAL)
Recommended previous knowledge
The students are assumed to have basic programming skills, and to have a good understanding of recursion. The students are also assumed to be familiar with basic mathematical notation and such concepts as functions, monotonicity, logarithms, polynomials, limits, sets, relations, orders, graphs, trees, permutations and combinations, proof by induction, series and partial sums, and basic probability calculus. Specifically TDT4100 or TDT4102 Object-Oriented Programming and TMA4140 or MA0301 Discrete Mathematics are recommended.
Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, fourth edition. (This may change.)
Credits: 7.5 SP
Study level: Intermediate course, level II
Term no.: 1
Teaching semester: AUTUMN 2023
Language of instruction: Norwegian
- Technological subjects
Examination arrangement: School exam
- Term Status code Evaluation Weighting Examination aids Date Time Examination system Room *
- Autumn ORD School exam 100/100 E 2023-12-12 15:00 INSPERA
Room Building Number of candidates SL310 hvit sone Sluppenvegen 14 43 SL311 grønn sone Sluppenvegen 14 3 SL324 Sluppenvegen 14 1 SL325 Sluppenvegen 14 1 SL238 Sluppenvegen 14 10 SL123 Sluppenvegen 14 1 SL520 Sluppenvegen 14 38 SL321 Sluppenvegen 14 2 SL311 orange sone Sluppenvegen 14 32 SL110 turkis sone Sluppenvegen 14 80 SL110 hvit sone Sluppenvegen 14 64 SL110 lilla sone Sluppenvegen 14 64 SL111 grønn sone Sluppenvegen 14 50 SL111 brun sone Sluppenvegen 14 81 SL111 blå sone Sluppenvegen 14 36 SL111 orange sone Sluppenvegen 14 60 SL111 lyseblå sone Sluppenvegen 14 72 SL210 Sluppenvegen 14 51 SL310 turkis sone Sluppenvegen 14 55 SL310 blå sone Sluppenvegen 14 48 SL310 lilla sone Sluppenvegen 14 80
- Summer UTS School exam 100/100 E 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"