Cancelled Topics in Algorithms and Complexity (TAC)

Course content

The purpose of this course is to present a set of topics that reflect state-of-the-art research and applications within algorithms and complexity. Particular topics will change from year to year.

Ask the course-responsible teacher for information on the topics covered in a particular year.

Learning outcome

Knowledge of

  • Selected state-of-the-art algorithmic and complexity results, and techniques and paradigms involved in these.

Skills in

  • Reading state-of-the-art papers related to the topics covered in the course and communicating key ideas in such papers.
  • Preparing a report on a research paper.
  • Preparing and giving a seminar talk on a research paper.

Competences to

  • Present technical results to an audience of peers, both orally and in writing.
  • Recognise the applicability of algorithms and complexity in both theoretical and practical settings.

The course has three components.

1. Lectures and weekly exercises.
2. Seminars - where students present a chosen paper [this could be something relevant to later Master's thesis work]. There will be an opponent group for each presentation, and the teacher will also ask questions.
3. A project - where students write a report on their chosen paper.

See Absalon for a list of course literature.

The students should be comfortable with formal, mathematical reasoning, as the course uses the power of mathematics to understand and prove good performance of algorithms. The students should have had at least one prior MSc-level course in algorithms and complexity.

Academic qualifications equivalent to a BSc degree is recommended.

This course is identical to NDAK11006U Topics in Algorithms & Data Structures (TADS) and NDAK22004U Research Topics in Algorithms and Complexity (RTAC) - you are not allowed to sign up for TAC if you already passed TADS or RTAC.

Continuous feedback during the course of the semester
Peer feedback (Students give each other feedback)

Collective feedback is given in groups of 2-3 students.

7,5 ECTS
Type of assessment
Oral examination, 30 minutes
Type of assessment details
Individual oral examination without preparation. The examination is primarily based on the paper chosen by the student, but may include other parts of the course syllabus as well.
Exam registration requirements

Approved report and presentation on the chosen paper.

All aids allowed
Marking scale
7-point grading scale
Censorship form
No external censorship
Several internal examiners

Same as the ordinary exam.

If the student is not yet qualified for the exam, then qualification for the re-exam can be achieved by submitting a report on the chosen paper.

The report must be submitted three weeks before the re-exam and approved no later than two weeks before the re-exam.

Criteria for exam assessment

See Learning Outcome.

Single subject courses (day)

  • Category
  • Hours
  • Lectures
  • 24
  • Class Instruction
  • 10
  • Preparation
  • 121
  • Project work
  • 50
  • Exam
  • 1
  • English
  • 206


Course number
7,5 ECTS
Programme level
Full Degree Master

1 block

Block 1
No limit
The number of seats may be reduced in the late registration period
Study Board of Mathematics and Computer Science
Contracting department
  • Department of Computer Science
Contracting faculty
  • Faculty of Science
Course Coordinator
  • Mikkel Vind Abrahamsen   (4-706c646543676c316e7831676e)
Saved on the 30-06-2023

Are you BA- or KA-student?

Are you bachelor- or kandidat-student, then find the course in the course catalog for students:

Courseinformation of students