Syllabus for Scientific Computing for Data Analysis

Beräkningsvetenskap för dataanalys

A revised version of the syllabus is available.


  • 5 credits
  • Course code: 1TD352
  • Education cycle: First cycle
  • Main field(s) of study and in-depth level: Computer Science G2F, Technology G2F

    Explanation of codes

    The code indicates the education cycle and in-depth level of the course in relation to other courses within the same main field of study according to the requirements for general degrees:

    First cycle

    • G1N: has only upper-secondary level entry requirements
    • G1F: has less than 60 credits in first-cycle course/s as entry requirements
    • G1E: contains specially designed degree project for Higher Education Diploma
    • G2F: has at least 60 credits in first-cycle course/s as entry requirements
    • G2E: has at least 60 credits in first-cycle course/s as entry requirements, contains degree project for Bachelor of Arts/Bachelor of Science
    • GXX: in-depth level of the course cannot be classified

    Second cycle

    • A1N: has only first-cycle course/s as entry requirements
    • A1F: has second-cycle course/s as entry requirements
    • A1E: contains degree project for Master of Arts/Master of Science (60 credits)
    • A2E: contains degree project for Master of Arts/Master of Science (120 credits)
    • AXX: in-depth level of the course cannot be classified

  • Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
  • Established: 2022-03-03
  • Established by: The Faculty Board of Science and Technology
  • Applies from: Autumn 2022
  • Entry requirements:

    60 credits including a programming course in Python (eg Computer programming I) and Algebra and Geometry/Linear Algebra I. Participation in one of the courses Introduction to Scientific Computing and Scientific Computing I. Participation in Probability and Statistics. Participation in Linear Algebra II/Linear Algebra for Data Analysis or the course can be taken in parallel.

  • Responsible department: Department of Information Technology

Learning outcomes

On completion of the course, the student should be able to:

  • account for and perform tasks that require knowledge of the key concepts included in the course;
  • describe, use and implement the algorithms included in the course;
  • analyze the computational and memory complexity of different algorithms;
  • solve technical and scientific problems given the mathematical model, by structuring the problem, choosing the appropriate numerical method, and generating a solution using software and your own code;
  • present, explain, summarize, evaluate and discuss solution methods and results in a small report.


Stochastic models, Monte-Carlo methods, Inverse Transform Sampling (ITS), stochastic simulation, Gillespies algorithm. Least square approximation with application to linear systems and regression models. QR factorization and Householder transforms. Methods for eigenvalues and eigenvectors (power method and QR method). Singular value decomposition (SVD) and Principal component analysis with applications. Important key concepts included in the course include stochastic/deterministic model and method, rotations and reflections, matrix factorization, singular values.


Lectures, laboratory exercises, problem solving sessions.


Written exam (3 hp). Problem solving and assignments with a written report (2 hp).

If there are special reasons for doing so, an examiner may make an exception from the method of

assessment indicated and allow a student to be assessed by another method. An example of special

reasons might be a certificate regarding special pedagogical support from the disability coordinator of the


Syllabus Revisions

Reading list

Reading list

Applies from: Autumn 2022

Some titles may be available electronically through the University library.

  • Föreläsningsanteckningar och webbaserat material

    Institutionen för informationsteknologi,