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.

The course is identical to:
NDAK11006U Topics in Algorithms & Data Structures (TADS)
NDAK22004U Research Topics in Algorithms and Complexity (RTAC)

Written
Oral
Collective
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.

ECTS
7,5 ECTS
Type of assessment
Oral exam on basis of previous submission, 30 minutes (no preparation time)
Type of assessment details
Individual oral examination without preparation. The examination is primarily based on the paper chosen by the student and the report, but may include other parts of the course syllabus as well.
To take the oral exam, the report must be submitted.
Aid
All aids allowed
Marking scale
7-point grading scale
Censorship form
No external censorship
Several internal examiners
Re-exam

Same as the ordinary exam.

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

Kursusinformation

Language
English
Course number
NDAK23005U
ECTS
7,5 ECTS
Programme level
Full Degree Master
Duration

1 block

Placement
Block 1
Schedulegroup
A
Capacity
No limitation – unless you register in the late-registration period (BSc and MSc) or as a credit or single subject student.
Studyboard
Study Board of Mathematics and Computer Science
Contracting department
  • Department of Computer Science
Contracting faculty
  • Faculty of Science
Course Coordinator
  • Mikkel Vind Abrahamsen   (4-726e666745696e33707a336970)
Saved on the 14-02-2024

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