Course Objectives

The students will learn about basic data structures, useful operations on these structures, and how to use these data structures to find efficient solutions to typical algorithmic problems dealing with large amounts of data.

Course Description

Data structures like lists, tree structures and graphs will be lectured. The represenation of these, and how to use them for storage and search. Emphasis will be on dynamic data structures and recursive programming, and ways of modularisation of data structures. In the implementation, an object oriented language will be used.

Learning Methods

8-10 hours of lecturing, excercises and supervising pr week in spring semester.

Assessment Methods

Obligatory assignments must be approved before the exam. Individual, written, 5 hour exam.

Minor adjustments may occur during the academic year, subject to the decision of the Dean