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.

Teaching and Learning Methods

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

Assessment Methods

• Written examination, 5 hours, graded mark
• Work requirements, approved assignments that must be approved in order for the student to take the written examination

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