Syllabus for Program Design and Data Structures

Programkonstruktion och datastrukturer

Syllabus

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

    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: 2010-03-18
  • Established by:
  • Revised: 2018-08-30
  • Revised by: The Faculty Board of Science and Technology
  • Applies from: week 30, 2019
  • Entry requirements: Information Technology (introductory course). Basic course in mathematics.
  • Responsible department: Department of Information Technology

Reading list

Reading list

Applies from: week 30, 2019

Some titles may be available electronically through the University library.

Recommended literature

  • Thompson, Simon Haskell : the craft of functional programming

    3. ed.: Harlow: Addison-Wesley, 2011

    Find in the library

Reference literature

  • Cormen, Thomas H. Introduction to algorithms

    3. ed.: Cambridge, Mass.: MIT Press, cop 2009

    Find in the library

    Mandatory

  • Lipovača, Miran Learn you a Haskell for great good! : a beginner's guide

    San Francisco, CA: No Starch Press, cop. 2011

    Find in the library

  • Okasaki, Chris Purely functional data structures

    Cambridge: Cambridge University Press, 1998

    Find in the library