Table of contents:

Lectures

Weekday Time Where?
Friday 08:15 - 11:00 A1 (Adolf Øien building)
Week Lecture Material Slides
34 Introduction: Some Representative Problems Chapter 1 PDF
35 Basics of Algorithm Analysis Chapter 2 PDF
36 Graphs Chapter 3 PDF
37 Graph Search Methods
Divide and Conquer 		Chapter 3
Chapter 4 		PDF
PDF
38 Greedy Algorithms - Part 1 Chapter 5 PDF
39 Greedy Algorithms - Part 2 Chapter 5 PDF
40 Dynamic Programming - Part 1 Chapter 6 PDF
41 Dynamic Programming - Part 2 Chapter 6 PDF
42 Network Flow - Part 1 Chapter 7 PDF
43 Network Flow - Part 2
NP and Computational Intractability - Part 1 		Chapter 7
Chapter 8 		PDF
PDF
44 NP and Computational Intractability - Part 2 Chapter 8 PDF
45 Extending the Limits of Tractability Chapter 10 PDF
46 Approximation Algorithms Chapter 11 PDF
47 Practice Exam Solution
Solving Previous TDT4120 Exam Questions
Time for Questions and Answers 		PDF
PDF

Assignment Lectures

There will be assignment lectures in the course, held by the teaching assistants. These will give a brief overview of the assignments and some general tips, along with going over the solution of previous assignments.

Weekday Time Where?
Wednesday 15:15 - 17:00 F1
Week Content Slides/Files
34 - -
35 Introduction and Information PDF (norwegian)
36 Assignment 1 - Similar Tasks and Tips
Assignment 2 - Basic Info 		PDF
37 Assignment 1 - Solution
Assignment 2 		PDF
38 Assignment 2 - Solution
Assignment 3 - Walkthrough 		PDF
39 Assignment 3 PDF-slides
PDF-notes
Integer Multiplication.ipynb
Matrix Multiplication.ipynb
40 Assignment 3 - Solution
Assignment 4 - Walkthrough 		PDF
Interval Scheduling.ipynb
41 Assignment 4
Assignment 5 - Walkthrough 		PDF
42 Assignment 4 - Solution PDF
43 Assignment 6 - Walkthrough PDF
44 Assignment 5 - Solution
Assignment 7 - Walkthrough 		PDF
PDF
45 Assignment 6 - Solution
Assignment 8 (Practice Exam) - Walkthrough 		PDF
PDF
46 Assignment 7 - Solution
 PDF
47 Assignment 9 - Solution PDF