Skip to main content
Till KTH:s startsida

DD1327 Fundamentals of Computer Science 6.0 credits

Information per course offering

Choose semester and course offering to see current information and more about the course, such as course syllabus, study period, and application information.

Termin

Information for Spring 2025 grudat25 programme students

Course location

KTH Campus

Duration
17 Mar 2025 - 2 Jun 2025
Periods
P4 (6.0 hp)
Pace of study

33%

Application code

60352

Form of study

Normal Daytime

Language of instruction

Swedish

Course memo
Course memo is not published
Number of places

Places are not limited

Target group

Only open to CTFYS.

Planned modular schedule
[object Object]

Contact

Examiner
No information inserted
Course coordinator
No information inserted
Teachers
No information inserted

Course syllabus as PDF

Please note: all information from the Course syllabus is available on this page in an accessible format.

Course syllabus DD1327 (Spring 2025–)
Headings with content from the Course syllabus DD1327 (Spring 2025–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

Algorithms and data structures: a systematic overview of the concepts abstract data types, stacks, queues, lists, trees, searching, sorting and recursion based on the knowledge the students acquired in the programming course.

Introductory programming. Hashing, priority queues, search trees, problem trees and simple syntax analysis and regular expressions.

Algorithm analysis with regard to both efficiency and correctness. Correctness proofs.

Programming: software development methodology, program quality, abstraction, modularisation, testing, system calls, standard libraries.

Intended learning outcomes

After passing the course, the student should be able to

− systematically test programs to discover errors
− use abstraction as a tool to simplify the programming
− design and document program packages that other programmers can use
− select an appropriate algorithm for a given problem
− compare algorithms with regard to time and memory usage
− describe and implement different algorithms for search and sorting
− model problems using graphs and implement algorithms for searching in graphs
− formulate and implement recursive algorithms
− write and use a simple BNF syntax
− implement, and design algorithms for, basic data structures
− determine correctness for iterative and recursive algorithms
− design and use regular expression

in order to

− become a good problem solver using programming
− be able to use computational methods in application projects
− be able to take advanced courses in computational mathematics, machine learning and theoretical computer science.

Literature and preparations

Specific prerequisites

DD1331 or equivalent (for example DD1310).

Recommended prerequisites

DD1331 Fundamentals of Programming and SF1672 Linear algebra, or the equivalent. 

Literature

You can find information about course literature either in the course memo for the course offering or in the course room in Canvas.

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

Examination

  • HEM1 - Individual Home Assignments, 4.0 credits, grading scale: A, B, C, D, E, FX, F
  • PRO1 - Individual Project Assignment, 2.0 credits, grading scale: P, 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.

The assignments should be submitted in writing before the deadline and should be presented orally and with peer review during the exercise sessions. Reflection questions are included in the project task at the end of the course.

Other requirements for final grade

Attendance is mandatory for the exercises where assignments are to be presented.

Examiner

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 room in Canvas

Registered students find further information about the implementation of the course in the course room in Canvas. A link to the course room can be found under the tab Studies in the Personal menu at the start of the course.

Offered by

Main field of study

Technology

Education cycle

First cycle

Transitional regulations

Students who have one of the components remaining from the 2023 and 2024 course offerings may follow the new structure, but their assignment results will be assessed and reported according to the components and credits that applied in 2024.

Students who have both components remaining will be examined on HEM1 and PRO1.

Supplementary information

Only one of the following courses can be counted in your degree: DD1320, DD1321, DD1325, DD1326, DD1327, DD1338, DD1339, DD1340, DD1341, DD1343, DD1344, DD1345, DD2325, EL2310, HI1201, ID1020, ID1021.

In this course, the EECS code of honor applies, see:
http://www.kth.se/en/eecs/utbildning/hederskodex