Table of contents

The course is connected to the following study programs

Teaching language

Norwegian. The course may be taught in English if exchange students participate. More information at the start of the semester.

Recommended previous knowledge

The course presupposes that the students have acquired basic programming skills, by taking IS-110 Object Oriented Programming, or equivalent.

Learning outcomes

Upon succesful completion of the course sthe students will:

  • be familiar with common algorithms and data structures.
  • know the resource consumption of these algorithms and how it can be expressed in Big-O notation
  • be able to use this knowledge to make rational choices of algoritms and data structures in their own programs

Contents

Common data structures, e.g. lists, queues, stacks, trees, graphs, hash tables. Algorithms for inserting, retrieving, deleting and sorting data. Analysis of algorithms and asymptotical notation.

Teaching and learning methods

Organized teaching of up to 4 hours lectures and 4 hours of supervised lab work per week, combined with compulsory assignments.

Examination requirements

Pass mandatory assignments. Further information is provided in Canvas at the start of the semester.

Examinations

A 4 hour written, individual exam with graded marks.

Student evaluation

The person responsible for the course decides, in cooperation with student representative, the form of student evaluation and whether the course is to have a midway or end of course evaluation in accordance with the quality system for education, chapter 4.1.

Offered as a free-standing course

Yes. Subject to availability or capacity.

Admission for external candidates

No

Reduction of Credits

This course’s contents overlap with the following courses. A reduction of credits will occur if one of these courses is taken in addition:

Course Reduction of Credits
IS-207 – Algorithms and Data Structures. 7.5
Last updated from FS (Felles studentsystem) Oct. 15, 2026 10:56:26 AM