Skip to main content
About course

DD1344 Fundamentals of Computer Science 6.0 credits

Administer About course

Course offerings are missing for current or upcoming semesters.
Headings with content from the Course syllabus DD1344 (Autumn 2009–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

Classical data structures: stacks, queues, lists, priority queues, trees, graphs, hash tabels etc.

Algorithms and algorithms analysis: searching and sorting, optimization, pattern matching, complexity measures, theoretical limits.
Abstraction techniques: abstract data types, interface.
Problem solving techniques: recursion, hierarchical decomposition, abstraction.

Intended learning outcomes

After the course, the student should be able to

  • use the algorithms and the data structures in the course to deal successfully with practical problems of the types occurring in labs and tests (these are all on the web),
  • analyse the properties of algorithms in practical problems of the types occurring in labs and tests.

in order to

  • develop computer scientific thinking and thereby get greater benefit from programming tasks,
  • become a better programmer.

Literature and preparations

Specific prerequisites

No information inserted

Recommended prerequisites

The course 2D1342/DD1342 Program Construction or equivalent.

Equipment

No information inserted

Literature

To be announced at least 4 weeks before course start at the web page for the course. Previous year: Pythonkramaren (compendium).

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

  • LAB1 - Laboratory Assignments, 1.5 credits, grading scale: P, F
  • TEN1 - Examination, 4.5 credits, grading scale: 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.

In this course all the regulations of the code of honor at the School of Computer science and Communication apply, see: http://www.kth.se/csc/student/hederskodex/1.17237?l=en_UK.

Other requirements for final grade

A written examination (TEN1; 4,5 university credits). Programming assignments (LAB1; 1,5 university credits).

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted

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

Information Technology, Technology

Education cycle

First cycle

Add-on studies

Second courses in computer science, especially DD2385 Program Development Techniques, DD1334 Database Technology, DD2354 Algorithms and Complexity.

Contact

Henrik Eriksson, tel: 790 8163, e-post: he@csc.kth.se

Supplementary information

Laboratory assignments can be done in Swedish or English.

Only one of the following courses can be counted in your degree: 2D1340/DD1340, 2D1341, 2D1343/DD1343, 2D1344/DD1344, 2D1345/DD1345,
2I1026.

The course is given for the last time 2010/2011.