Course Objectives

The students will gain proficiency in basic data structures, and with the operations connected to these, and how various data structures may be used to effectively solve some typical algorithmic problems, in which large volumes of data need to be managed.

Course Description

The course will focus on how various data structures, such as lists, tree structures and graphs may be represented and used for different types of storage and searching. Emphasis will be placed on dynamic structures and recursive programming, and modularisation techniques. An object-oriented language will be used for implementation.

Learning Methods

8-10 hours of lectures, exercises and guidance per week in the spring semester.

Assessment Methods

Two 1-hour individual, written mid-term examinations and an individual, 3-hour written final examination. The mid-term examinations count for 40% of the final grade, and the final examination for 60%. Obligatory assignments submitted during the course must be approved before the student will be permitted to sit the final examination. All parts of the assessment must receive passing marks.

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