Data Structures and Algorithms I

Basics of programming and mathematics

After the course the student

• knows the O notation and can use it to analyze algorithms and find a suitable algorithm for a task

• knows efficient sorting algorithms and can use them in algorithm design

• knows ways to implement list and hash structures

• can use recursion in programming

• knows the basic concepts of graphs and algorithms for graph traversal
  

Online material

Completion methods

The course can be taken by participating in the course activities and participating in a supervised course exam that requires attendance.

Alternatively, the course can be taken by a separate exam.

The implementation methods of the Open University may differ from those of the degree program.

Assessment practices and criteria

Grading is 1–5. The assessment is based on a course exam and tasks solved online or in exercises, or a separate exam.

Activities and methods in support of learning

The course includes some of the following: Lectures, automatically graded assignments, exercise sessions, self-evaluation of your own solutions in relation to model solutions.

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 BSCS1000
  

• 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 1

Recommended time or stage of studies for completion

For the students in Computer and Data Science study track the first year of studies. 

Study module

Computer Science and Data Science, basic studies BSCS1000 and Computer Science and Data Science, study module BSCS4000

Language of instruction

English