Skip to main content

Before choosing course

This is a course in applied programming and computer science.

Choose semester and course offering

Choose semester and course offering to see information from the correct course syllabus and course offering.

* Retrieved from Course syllabus DD1321 (Autumn 2020–)

Content and learning outcomes

Course contents

Python programming. Program quality. Testing and debugging. Exceptions. System calls. Library functions. Abstract datatypes, stack, queue, tree. Search, sort, recursion. Hash, binary search trees, tree traversals, deep/breadth-first algorithm. C-programming, type-directed programming, compiling, linking, building, make-files.

Intended learning outcomes

During this course we will teach you to:

  • write structured programs either in Python or in C,
  • systematically debug programs,
  • write automated test programs,
  • use abstraction as a tool to simplify programming,
  • write prototypes using Python,
  • know about international programming standards,
  • component programming,
  • select an appropriate algorithm for certain problems,
  • compare algorithms considering memory use or complexity,
  • describe the qualities and characteristics of different algorithm such as seek and sort,
  • propose and implement recursive algorithm,
  • model real problems such as seek problems and implement algorithm for depth/width/best-first seek,
  • describe elementary compression algorithm,
  • implement and use stacks and queues,
  • implement and use binary trees of different kinds,
  • implement and use hash tables and hash functions
  • use priority queues,
  • identify problems where the above mentioned data structures are useable,

so that you will be able to:

  • feel confident to solve programming problems,
  • use computer science methods in real world projects,
  • test computer systems,
  • continue study more advanced courses in computer science (internationally or nationally).

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites

Completed course in numerical methods and basic programming corresponding to SF1511/SF1516/SF1518/SF1519/SF1521.

Active participation in a course offering where the final examination is not yet reported in LADOK is considered equivalent to completion of the course. This applies only to students who are first-time registered for the prerequisite course offering or have both that and the applied-for course offering in their individual study plan.

Recommended prerequisites

No information inserted


No information inserted


No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

A, B, C, D, E, FX, F


  • LABD - Programming assignments, 3,0 hp, betygsskala: A, B, C, D, E, FX, F
  • LABP - Programming assignments, 3,0 hp, betygsskala: P, F
  • TEN1 - Examination, 3,0 hp, betygsskala: A, B, C, D, E, FX, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted


Profile picture Alexander Baltatzis

Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web DD1321

Offered by

EECS/Computer Science

Main field of study


Education cycle

First cycle

Add-on studies

Second courses in computer science: DD2350, DD1418, DD1334, DD1377, DD1420/DD2421, DH2323. In addition DD1380 followed by DD1385 or DD1389.


Alexander Baltatzis, tel: 790 6209, e-post:

Supplementary information

You can only count one of the following courses in your exam: DD1320, DD1321, DD1325, DD1327, DD1338, DD1339, DD1340, DD1341, DD1343, DD1344, DD1345, DD2325, EL2310, HI1201, ID1020, ID1021.

In this course, the EECS code of honor applies, see: