Course Objectives

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

Course Description

The course will focus on how various data structures such as lists, tree structures and graphs may be represented and used for various forms of storage and searching. Emphasis will be placed on dynamic data structures and recursive programming, and methods for modularising data structures. Object-oriented language will be used for implementation.

Learning Methods

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

Assessment Methods

Compulsory assignments, which are part of the continuous assessment, must be approved before students will be allowed to sit the individual, written 5-hour final examination.

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