2024 Spring 2023 Spring 2022 Spring 2021 Spring 2020 Spring 2019 Spring 2018 Spring 2017 Spring 2016 Spring 2015 Spring 2014 Spring 2013 Spring 2012 Spring 2011 Spring 2010 Spring 2009 Spring 2008 Spring 2007 Autumn 2006 Autumn
Show the courses of study containg this course Se overgangsordninger
Dansk English

DM507: Algorithms and Data Structures (10 ECTS)

STADS: 15016701

Level
Bachelor course

Teaching period
The course is offered in the spring semester.

Teacher responsible
Email: rolf@imada.sdu.dk

Timetable
Group Type Day Time Classroom Weeks Comment
Common I Monday 14-16 U110 21
Common I Tuesday 10-12 U140 6-8,10,12-13,15-21
Common I Thursday 10-12 U140 6,8,13,16,18
Common I Thursday 10-12 U20 10
D1 TE Wednesday 12-14 U156 6-8,10-11,13,15-21
D1 TE Thursday 12-14 U156 7,12,15,17,19,21
D2 TE Wednesday 10-12 U156 6-8,10-11,13,15-21
D2 TE Thursday 14-16 U154 19
D2 TE Friday 10-12 U24 7,12,15,17,21
O1 TE Tuesday 14-16 U147 8
O1 TE Wednesday 08-10 U147 6-7,10-11,13,15-21
O1 TE Friday 12-14 U24 7
O1 TE Friday 12-14 U23a 12,15,17,21
O1 TE Friday 08-10 U23a 19
T1 TE Tuesday 08-10 U156 7-8,10,12-13,15-22
T1 TE Thursday 08-10 U155 7,10,15,17,19,21
Show entire timetable
 Show personal time table for this course.

Comment:
Ubegrænset deltagerantal.

Prerequisites:
None

Academic preconditions:
Knowledge of the contents of DM550 Introduction to Programming is necessary. Knowledge of the contents of DM549 Discrete Methods for Computer Science is recommended.

 

Course introduction
To acquaint the students with a wide range of fundamental algorithms and data structures. Furthermore, we introduce general methods for development of algorithms, as well as mathematical tools for analyzing the correctness and efficiency of algorithms.

Expected learning outcome
After the course, the student is expected to be able to:

  • use the algorithms taught in the course on concrete problem instances.
  • give precise arguments for the correctness or incorrectness of an algorithm.
  • determine the asymptotic running time of an algorithm.
  • adapt known algorithms and data structures to special cases of known problems or new problems.
  • design new algorithms for problems similar to those taught in the course. This includes giving a precise description of the algorithm, e.g. using pseudocode.
  • make expedient choices of data structures.
  • design new data structures based on known data structures.
  • design and implement a larger program, using algorithms and data structures taught in the course.
  • give precise arguments for the choices made in connection with the previous 4 items.
Subject overview
Mathematical basis: recursion equations.

Algorithms: correctness and complexity analysis, greedy algorithms, divide and conquer, dynamic programming, sorting, graph algorithms, Huffmann-coding.

Data structures: trees, dictionaries, priority queues, disjoint sets.

Literature

    Meddeles ved kursets start.


Website
This course uses e-learn (blackboard).

Prerequisites for participating in the exam
A mandatory project. Internal examiner. Passed/not passed. The project must be passed to in order to be admitted to the exam. (15016712)

Assessment and marking:
A 4 hour written exam where books, notes and calculators may be used. External examiner. Grades according to the 7-point marking scale. (15016702)

Reexam after 4th quarter in August. The reexam is an oral exam with external examiner and grades according to the 7-point grading scale.

Expected working hours
The teaching method is based on three phase model.
Intro phase: 44 hours
Skills training phase: 40 hours, hereof:
 - Tutorials: 40 hours

Educational activities Study phase: 14 hours

Language
This course is taught in Danish or English, depending on the lecturer.

Course enrollment
See deadline of enrolment.

Tuition fees for single courses
See fees for single courses.