Syllabus for Algorithms and Data Structures I

Algoritmer och datastrukturer I

A revised version of the syllabus is available.


  • 5 credits
  • Course code: 1DL210
  • Education cycle: First cycle
  • Main field(s) of study and in-depth level: Computer Science G1F, Technology G1F
  • Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
  • Established: 2007-03-19
  • Established by: The Faculty Board of Science and Technology
  • Revised: 2010-04-27
  • Revised by: The Faculty Board of Science and Technology
  • Applies from: week 27, 2010
  • Entry requirements: 10 credits in computer programming (Program Design, Programming Techniques II, or equivalent) and 10 credits in mathematics, including basic algebra.
  • Responsible department: Department of Information Technology

Learning outcomes

In order to pass, the student must be able to

  • analyse the runtime performance of a (simple) algorithm/program in terms of the size of its inputs, and this in the average, best, and worst cases.

  • choose appropriate algorithms and data structures for storing data, searching and sorting, as well as implement those algorithms.

  • use and implement basic graph algorithms.


Mathematical foundations: asymptotic notation, summations, recurrence relations.
Data structures: trees, priority queues, heaps.
Searching: binary search trees, balanced search trees, hash tables.
Sorting: merge sort, quick sort, heap sort.
Graph algorithms: depth first and breadth first search.
Implementation of algorithms and data structures.


Lectures, laboratory work, lessons, and mandatory assignments.


Written exam (4 p). Assignments (1 p).

Other directives

The unit cannot be included in a degree with Program Design II (1IT022), nor with Data Structures (1DL009, 1TD191, 1MB026).

Reading list

Reading list

Applies from: week 27, 2009