Topics in Algorithms and Data Structures (TADS)

Course content

The purpose of this course is to present a set of topics that reflect state-of-the-art research and applications within the design and analysis of algorithms and data structures. 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 algorithms and data structures 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


Comptences to:

  • Present technical results to an audience of peers, both orally and in writing
  • Recognize the applicability of algorithms and data structures in both theoretical and practical settings

The course has three components.

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

See Absalon when the course is set up.

Should have had at least one prior MSc-level course in algorithms and data structures.

ECTS
7,5 ECTS
Type of assessment
Oral examination, 30 min
The oral exam is without preparation. Primarily in the paper chosen by student, but also other parts of the course material.
Marking scale
7-point grading scale
Censorship form
No external censorship
Several internal examiners
Criteria for exam assessment

See learning outcome.

Single subject courses (day)

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