Skip to main content
Till KTH:s startsida

ID1005 Algorithms and Data Structures 7.5 credits

Information per course offering

Course offerings are missing for current or upcoming semesters.

Course syllabus as PDF

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

Course syllabus ID1005 (Spring 2011–)
Headings with content from the Course syllabus ID1005 (Spring 2011–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

Progression of the course ID1004:

  • Algorithms - searching, sorting, hashing.
  • Data structures - list, stack, queue, tree, graph.
  • Presentation of classes and inheritance hierarchies (over shadowing, overloading, bonding, etc.).
  • "Design patterns" I / O (eg file management).
  • Exception handling.
  • Algorithm Design and Analysis.
  • Genericitet.
  • Recursion.

Intended learning outcomes

After the course, you must be able to:

  • documenting the classes in such a way that they can be reused by other programmers (for example, in a class library)
  • discuss the appropriateness, effectiveness, etc. of two or more solutions of the same problems

You show that you have achieved these objectives through describing the work process and the results of executing your programs.

  • select and use relevant, to the program, abstract data types (list, tree or graph)
  • construct class hierarchies
  • Create reusable components
  • use the "design patterns" in software engineering
  • know the principles and be able to use exception handling

You show that you have reached those goals by solving, written document and oral report assignments.

  • discuss some common search and sort algorithms, their properties and their use
  • propose, implement and justify an algorithm as part of a problem (in terms of time complexity, memory usage, etc.)
  • propose, implement and justify a data structure as part of a problem (in terms of seek time, time complexity, memory usage, etc.)
  • discuss the object oriented concepts such as inheritance, shadowing, overloading, bonding, etc.

You show that you have achieved these objectives on the exam.

Literature and preparations

Specific prerequisites

Completed upper secondary education including documented proficiency in Swedish corresponding to Swedish B and English corresponding to English A. For students who received/will receive their final school grades after 31 December 2009, there is an additional entry requirement for mathematics as follows: documented proficiency in mathematics corresponding to Mathematics A. And the specific requirements of mathematics, physics and chemistry corresponding to Mathematics D, Physics B and Chemistry A.

Literature

Fastställs senare.

Examination and completion

Grading scale

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

Examination

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

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

Other requirements for final grade

Passed exam and laboration work.

Examiner

No information inserted

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