Data Structures and Algorithms II

Data Structures and Algorithms I

After the course the student

• knows how balanced binary trees and binary heaps work

• can use dynamic programming in algorithm design

• knows algorithms for finding shortest paths in graphs

• can efficiently process directed acyclic graphs

• knows the union-find structure and can use it for finding minimum spanning trees

• can determine the maximum flow in a graph and some reductions
  

Online material in the MOOC environment

The course is suitable for anyone interested in data structures and algorithms.

Completion methods

The course is based on online assignments and may include a component requiring attendance, such as an exam. There can also be lectures and assistance.

Alternatively, the course can be passed by taking a separate exam, which consists of a written exam only.

Open University and degree programme completion methods may be different.

Assessment practices and criteria

Grading is 1–5.

Activities and methods in support of learning

Automatically graded problems in the MOOC environment

Target groups

The course is suitable for anyone interested in data structures and algorithms. 

• Compulsory for the students in Bachelor's Programme in Science, study track Computer and Data Science study track study module BSCS2000
  

• optional study for students in other study tracks in BSc BSCS4000

• The course is available to students from other degree programmes

• The course may be offered among the university’s continuous learning courses.

Teaching period when the course will be offered

Period 4

Recommended time or stage of studies for completion
Study module
Expiry of studies
Language of instruction

English