DM507: Algorithms and Data Structures

Students taking the course are expected to:

• Have knowledge of the
  contents of DM549 Discrete Methods for Computer Science. In particular,
  some amount of mathematical maturity is assumed.
• Be able to use
  the methods from DM550 Introduction to Programming. In particular,
  familiarity with programming in Java is assumed.

The course builds on the knowledge
acquired in the courses DM549 Discrete Methods for Computer Science and
DM550 Introduction to Programming, and gives an academic basis for
studying the algorithmical and complexity theoretical topics that are
part of the degree. In relation to the competence profile of the degree
it is the explicit focus of the course to:

• Give the competence to develop new variants of central algorithms and data structures developed within computer science.
• Give skills to analyze pros and cons of algorithms, in particular with respect to the use of resources.
• Give knowledge and understanding of a selection of core algorithms and data structures developed within computer science.

The learning objective of the course is that the student demonstrates the ability 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 four items.

See danish version