Stockholm university logo, link to start page
Gå till denna sida på svenska webben

Computer Science for Mathematicians

This is a second course in computer science, which assumes that you have already taken a course equivalent to DA2004 Programming techniques for mathematicians.

You will learn to work on the command line and, e g, use version control systems and unit testing; analyse and compare algorithms with respect to time- and memory-complexity; use and implement basic sorting algorithms, depth-first and width-first search; stacks, queues, hash tables and similar data structures; write simple routines with processes and threads.

  • Course structure

    The course consists of three elements; theory, project assignment and practical exercises.

    Teaching format

    Teaching consists of lectures, project work and computer exercises.


    The course is assessed through a written exam, oral presentation (at a computer) of practical exercises, and written presentation of the project assignment. For a passing grade on the course, a passing grade on each element is required.


    A list of examiners can be found on

    Exam information

  • Schedule

    The schedule will be available no later than one month before the start of the course. We do not recommend print-outs as changes can occur. At the start of the course, your department will advise where you can find your schedule during the course.
  • Course literature

    Note that the course literature can be changed up to two months before the start of the course.

    Cormen, Leiserson, Rivest, and Stein: Introduction to algorithms.

    List of course literature Department of Mathematics

  • Course reports

  • More information

    New student
    During your studies

    Course web

    We do not use Athena, you can find our course webpages on

  • Contact