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.
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.
Competences to
- Present technical results to an audience of peers, both orally and in writing.
- Recognise the applicability of algorithms and data structures 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 data structures.
Academic qualifications equivalent to a BSc degree is
recommended.
Collective feedback is given in groups of 2-3 students.
As
an exchange, guest and credit student - click here!
Continuing Education - click here!
PhD’s can register for MSc-course by following the same procedure as credit-students, see link above.
- ECTS
- 7,5 ECTS
- Type of assessment
-
Oral examination, 30 minutesIndividual 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.
- Aid
- All aids allowed
- 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
- Class Instruction
- 10
- Preparation
- 121
- Project work
- 50
- Exam
- 1
- English
- 206
Kursusinformation
- Language
- English
- Course number
- NDAK11006U
- ECTS
- 7,5 ECTS
- Programme level
- Full Degree Master
- Duration
-
1 block
- Placement
- Block 2
- Schedulegroup
-
C
- Capacity
- No limit
- Studyboard
- Study Board of Mathematics and Computer Science
Contracting department
- Department of Computer Science
Contracting faculty
- Faculty of Science
Course Coordinator
- Danupon Na Nongkai (3-727c7c4e72773c79833c7279)
Are you BA- or KA-student?
Courseinformation of students