DM507: Algorithms and Data Structures (10 ECTS)

STADS: 15000721

Level
Bachelor course

Teaching period
The course is offered in the spring semester.
Third and fourth quarter.

Teacher responsible
Email: rolf@imada.sdu.dk

Timetable
Show entire timetable
Show personal time table for this course.

Revison of timetable:
: Eksaminatorietimerne for hold S1 i DM507 om onsdagen fra kl. 16-18 i ugerne 07,11,13,17,19,21, har følgende ændringer: Uger ændret fra 07,11,13,17,19,21 til 07,11,13,17,19,21,22
: Eksaminatorietimerne for hold S2 i DM507 om torsdagen fra kl. 10-12 i ugerne 07,11,13,17,19,21, har følgende ændringer: Uger ændret fra 07,11,13,17,19,21 til 07,11,13,17,19,21,22

Comment:
Ubegrænset deltagerantal. 3. + 4. kvartal.

Prerequisites:
None

Academic preconditions:
The contents of Programming A and B (DM502 and DM503) must be known. Knowledge of the contents of Mathematical Tools for Computer Science (DM527) is recommended

OR The contents of DM536 Introduction to Programming and DM537 Object-oriented Programming must be known. Knowledge of the contents of DM535 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
None

Assessment and marking:
a) A 4 hour written exam where books, notes and calculators may be used. External examiner. Grades according to the 7-point marking scale.
b) A mandatory project that count 3 ECTS of the 10 ECTS course total. Internal examiner. Passed/not passed. The project must be passed to in order to be admitted to the exam.

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.