Algorithms and Datastructures (DAT200)

After ending this course the student should know how to:

Knowledge

• Be able to use standard data structures to implement effecient programs.

Skills

• Be able to calculate the efficiency of algorithms
• Be able to implement efficient recursive algorithms
• Be able to implement efficient algorithms for sorting and searching

General competency

• Know how data structures for lists, queues, stacks, heaps, binary trees and graphs can be implemented in Java.

Course teacher(s)

Head of Department:

Course coordinator:

Six hours of lecturing per week. All students can get help for the exercises at a room reserved for the purpose two hours a week. The exercises are approved by presenting them to the teacher or a student assistant during these four hours.

Completion of mandatory exercises are to be made at the times and in the groups that are assigned and published. Absence due to illness or for other reasons must be communicated as soon as possible to the laboratory personnel. One cannot expect that provisions for completion of the exercises at other times are made unless prior arrangements with the laboratory personnel have been agreed upon.

Failure to complete the assigned exercises on time or not having them approved will result in barring from taking the exam of the course.

Bachelor studies at the Faculty of Science and Technology.

Master studies at the Faculty of Science and Technology.

Data Structures and Problem Solving Using Java, Mark Allen Weiss, Published by Addision-Wesley.

A compendium will be posted on Canvas