Course

Algorithms and Datastructures (DAT200)


Dette er emnebeskrivelsen for studieåret 2013-2014

See course description and exam/assesment information for this semester (2024-2025)

Semesters

Fakta

Emnekode

DAT200

Vekting (stp)

10

Semester undervisningsstart

Autumn

Undervisningsspråk

English

Antall semestre

1

Vurderingssemester

Autumn

Timeplan

Vis timeplan

Content

Efficiency Analysis. Definition, usage, and implementations of abstract data types: Stacks, queues, lists, tree structures, graphs, priority queues, heaps. Hash techniques. Implementation and use of data structures that can represent graphs. Sorting techniques. Use of recursion as programming technique.

Learning outcome

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 the data structures, lists, queues, stacks, heaps, binary trees and graphs can be implemented in Java.

Forkunnskapskrav

Anbefalte forkunnskaper

Object-oriented Programming (DAT100)

Exam

Form of assessment Weight Duration Marks Aid Exam system Withdrawal deadline Exam date
Written exam 1/1 4 Hours Letter grades None permitted Inspera assessment 01.11.2013 25.11.2013


Vilkår for å gå opp til eksamen/vurdering

Hand-in assignments

Fagperson(er)

Head of Department:

Tom Ryen

Course coordinator:

Mina Farmanbar

Method of work

Lectures in classroom and guidance in the computer lab. Only those who have approved exercise 1, exercise 2 or exercise 3 and exercise 4 or exercise 5, can take the exam. The exercises have to be approved at least three weeks ahead of the examination date.

Overlapping

Emne Reduksjon (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

Åpent for

Bachelor studies at the Faculty of Science and Technology.

Master studies at the Faculty of Science and Technology.

Emneevaluering

Form and/or discussion.

Litteratur

Data Structures and Problem Solving Using Java Mark Allen WeissPublished by Addision-Wesley.

Kontakt

Head of Department:

Tom Ryen

Course coordinator:

Mina Farmanbar

Tilbys av

Faculty of Science and Technology

Department of Electrical Engineering and Computer Science

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