DD1327 Fundamentals of Computer Science 6.0 credits

Basic algorithms and data structures: A systematic review of the concepts of abstract data types, stacks, queues, lists, trees, searching, sorting and recursion. Hashing, priority queues, search trees and problem trees, simple syntax analysis and regular expressions.

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

Programming: software development methodology, software quality, abstraction, testing, standard libraries.

After passing the course, the student should be able to:

• systematically test programs to detect errors
• use abstraction as a tool to simplify programming
• design and document software packages that other programmers can use
• analyze and compare algorithms with respect to time and memory usage
• determine the correctness of iterative and recursive algorithms
•  describe and implement basic algorithms and data structures, e.g. depth-first and breadth-first search, binary search, sorting algorithms, binary trees, graphs, hash tables, linked lists
• choose or construct an appropriate algorithm and data structure to solve a given problem
• construct and use regular expressions and simple BNF syntax

in order to

• become good at solving problems with programming
• be able to use computational methods in application projects
• gain sufficient prior knowledge to be able to take advanced courses in computer science.

DD1331 or equivalent (for example DD1310).

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

• 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.

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

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

Emma Enström

• 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.

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