Course

Algorithms and Datastructures (DAT200)

Facts

Course code DAT200

Credits (ECTS) 10

Semester tution start Autumn

Language of instruction English

Number of semesters 1

Exam semester Autumn

Time table View course schedule

Literature Search for literature in Leganto

Introduction

The course provides an in-depth introduction to some commonly used data structures and algorithms.

Content

Algorithm efficiency analysis. Definition, usage, and implementations of abstract data types: Stacks, queues, lists, associative arrays, tree structures, graphs, priority queues, heaps. Hash techniques. Tree structures. Implementation and use of data structures that can represent graphs. Algorithms for sorting and searching. Some basic algorithms for graphs, including wayfinding. Use of recursion as programming technique.

Learning outcome

After ending this course the student should know how to:

Knowledge

  • Know how basic algorithms for sorting, searching and wayfinding in graphs work.
  • Know how basic data structures for lists, stacks, queues, priority queues, sets, associative arrays and graphs work

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 and algorithms for lists, queues, stacks, heaps, binary trees and graphs can be implemented.
  • Be able to use standard algorithms and data structures to implement efficient programs

Required prerequisite knowledge

None

Recommended prerequisites

Programming fundamentals (DAT120)

Exam

Written exam

Weight 1/1

Duration 4 Hours

Marks Letter grades

Aid None permitted

This course has digital exam. It will be possible to use Scantron to scan drawings made by hand and connect these to the digital exam.

Coursework requirements

Hand-in assignments

There are nine exercises in this course. In order to be allowed to take the exam at least seven out of the nine exercises need to be approved within the given deadline.

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.

The mandatory coursework requirements remain valid for up to three years from the semester in which they were approved. Students who take the examination after this period, or who fail or wish to improve their grade beyond three years, must complete all mandatory coursework again the next time the course is offered with regular teaching.

Method of work

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

Overlapping courses

Course Reduction (SP)
Algorithms and Datastructures (DAT200_1) , Data structures and algoritms (TE0458_1) 6
Algorithms and Datastructures (DAT200_1) , Data structures and algoritms (TE0458_A) 6
Datastructures and algorithms (BIE270_1) , Algorithms and Datastructures (DAT200_1) 10

Open for

Battery and Energy Engineering - Bachelor Civil Engineering - Bachelor Computer Science - Bachelor Computer Science - Bachelor (Part-Time) Electrical Engineering - Bachelor (Part-Time) Electrical Engineering - Bachelor Energy and Petroleum Engineering - Bachelor Geosciences and Energy Resources - Bachelor Environmental Engineering - Bachelor Mechanical Engineering - Bachelor Medical Technology - Bachelor Medical Technology - Bachlor (Part-Time) Industrial Economics - Master
Exchange programme at The Faculty of Science and Technology

Course assessment

The faculty decides whether early dialogue will be held in all courses or in selected groups of courses. The aim is to collect student feedback for improvements during the semester. In addition, a digital course evaluation must be conducted at least every three years to gather students’ experiences.

Contact

Course coordinator:
Nejm Saadallah
Head of Department:
Tom Ryen

Offered by

Faculty of Science and Technology

Department of Electrical Engineering and Computer Science

The course description is retrieved from FS (Felles studentsystem). Version 1