Skip to main content

ID1021 Algorithms and Data Structures 7.5 credits

A basic course in computer science, that will give prerequisites for several advanced courses in computer science. The course will cover both theory on algorithms and data structures as well as practical software design.

Choose semester and course offering

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

Headings with content from the Course syllabus ID1021 (Autumn 2022–) are denoted with an asterisk ( )

Content and learning outcomes

Course contents

Basic algorithm analysis:

  • Simpler analysis with respect to the resource needs of algorithms in the form of time and memory.

Fundamental algorithms:

  • simple numerical algorithms
  • sequential and binary search algorithms
  • Depth first search and Width first search.
  • sorting algorithms: selection sorting, insertion sorting, Quicksort, heapsort, mergesort.

Fundamental data structures:

  • linear lists, stacks, queues, hash tables, binary tree, heaps, binary search trees and problem trees.

Program Design:

  • design and implementation of programmes that use basic algorithms and data structures to solve computer science problems.

Intended learning outcomes

On completion of the course, students should be able to

  • describe a number of common algorithms for search and sorting and their properties
  • compare algorithms with regard to time and memory usage
  • implement data structures as linear lists stacks, queues, hash tables, binary tree and search trees
  • identify problems where the data structures above are useful and design simple algorithms with these
  • write programmes that use algorithms and data structures by means of good programming principles such as systematic tests and abstraction
  • model problems as search problems and implement algorithms for breadth-first-search, depth-first-search or best-first-search

in order to

  • be able to design programmes that solve problems by using commonly occurring algorithms and data structures
  • acquire sufficient prior knowledge to be able to take advanced courses in computer science.

Course disposition

No information inserted

Literature and preparations

Specific prerequisites

Knowledge and skills in programming, 7,5 credits, corresponding to completed course ID1018.

Recommended prerequisites

The course structure is based on the participants having programming skills and being able to edit without help, compile and run simpler programs even in languages they may not normally use or have used before.

Equipment

No information inserted

Literature

Course material will be available for download.

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

  • INL1 - Hand-in assignments, 7.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.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

No information inserted

Examiner

Profile picture Johan Montelius

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 ID1021

Offered by

EECS/Computer Science

Main field of study

Technology

Education cycle

First cycle

Add-on studies

No information inserted

Transitional regulations

Any results on the previous modules ARBA and TENA can not be credited for INL1.

Supplementary information

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

http://www.kth.se/en/eecs/utbildning/hederskodex