DM507: Algorithms and Data Structures (10 ECTS)
STADS: 15000701Level
Bachelor course
Teaching period
The course is offered in the spring semester.
Third and fourth quarter.
Teacher responsible
Email: rolf@imada.sdu.dkTimetable
| Group | Type | Day | Time | Classroom | Weeks | Comment |
|---|---|---|---|---|---|---|
| Common | I | Monday | 10-12 | U140 | 05-11, 15-20 | |
| Common | I | Wednesday | 14-16 | U140 | 05, 07, 09 | |
| Common | I | Wednesday | 08-10 | U140 | 20 | |
| Common | I | Friday | 14-16 | U140 | 11 | |
| M1 | TE | Thursday | 10-12 | U10 | 05-11, 15-18, 20-21 | |
| M1 | TE | Friday | 10-12 | U49E | 06, 08, 10 | |
| S7 | TE | Wednesday | 14-16 | U49B | 06, 08, 10 | |
| S7 | TE | Thursday | 14-16 | U27 | 05-11, 15-18, 20-21 |
Show personal time table for this course.
Revison of timetable:
: Forelæsning onsdag uge 20 i U140.
: Forelæsning fredag uge 11 i U140.
Comment:
Obligatorisk på Mat.Øk 2.år.
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.
Course introduction
To acquaint the students with fundamental classes of algorithms and to show how these can be realized efficiently through the use of data structures. Furthermore, we introduce the basic tools for analyzing the efficiency of algorithms.
Expected learning outcome
After the course, the student is expected to be able to:
1. use the algorithms taught in the course on concrete problem instances.
2. give precise arguments for the correctness or incorrectness of an algorithm.
3. determine the asymptotic running time of an algorithm.
4. adapt known algorithms and data structures to special cases of known problems or new problems.
5. 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.
6. make good choices of data structures.
7. design new data structures based on known data structures.
8. design and implement a larger program, using algorithms and data structures taught in the course.
9. Give precise arguments for the choices made in connection with items 4-8.
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:
• abstract data types,
• trees,
• dictionaries,
• priority queues,
• disjoint sets
Literature
- Meddeles ved kursets start.
Syllabus
See syllabus.
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 marking scale.
Expected working hours
The teaching method is based on three phase model.
Forelæsninger (32 timer) og eksaminatorier (32 timer).
Educational activities
Language
This course is taught in Danish or English, depending on the lecturer. However, if international students participate, the teaching language will always be English.
Course enrollment
See deadline of enrolment.
Tuition fees for single courses
See fees for single courses.
