Print

Algorithms and Data Structures

Code

IT-ADS1

Version

3.0

Offered by

ICT Engineering

ECTS

5

Prerequisites

A condition for following ADS1 is that you have followed the course MSE1 and SDJ2, or similar courses at your home institution.

The course must be passed before graduation.

Main purpose

The purpose of the course is to qualify the student to:
 
Design, implement and analyze different algorithms
Become acquainted with different advanced data structures
 

Knowledge

  • Know different linear data structures (sets, maps, lists and stacks)
  • Know different algorithm types and templates
  • Know the concept of Abstract Data Types
  • Know different Sorting and searching algorithms
  • Know different non-linear data types (Trees, Heaps and Graphs)

Skills

  • Be able to analyze algorithms using the Big-O notation
  • Be able to design and implement algorithms and data structures in an object oriented language

Competences

  • Be able to use algorithms and data structures to solve specific non-trivial problems.
  • Be able to make good choices of data structures for a specific problem
  • Be able to design and implement effective programs
  • Be able to analyze and improve existing programs
  • Be able to analyze algorithms using Big-O notation

Topics

 
 

‚Äč

Teaching methods and study activities

The required workload for students is estimated at 150 hours where approximately 44 hours (11 lessons of 1 hour) are in category 1 and 2 of the Student Activity Model. The rest is category 3.

 
CATEGORY 1
Participation of lecturer and students
Initiated by the lecturer
22. hours-  15%
  • Lessons, scheduled
  • Excursions
  • Project guidance
  • Laboratory work
  • Exams and tests
CATEGORY 2
Participation of students
Initiated by the lecturer
23. hours - 15%
  • Assignments, self-study
  • Project and group work
  • Homework and preparation for exams
  • Evaluation of the teaching
CATEGORY 3
Participation of students
Initiated by students
105 hours - 60 %
  •  Homework and preparation for exams
  • Self-study
  • Project work
  • Study groups
  • Literature search
CATEGORY 4
Participation of lecturer and students 
initiated by students
0 hours -0 %
  •  Debate meetings
  • Study guidance
 

Resources

 
Data Structures and Algorithm Analysis in Java, Third Edition, Pearson, International Edition, Mark Allen Weiss.
 
Other resources made available on Studynet.

Evaluation

Permit criteria for attending examination:
  • Mandatory course activities completed

Examination

Written examination
 
Duration: 3 hours
 
Allowed tools:
  • Course literature according to the course description
  • Personal notes

Internal examiner

Please note that re-examination may take a different form than the ordinary exam.

Grading criteria

Examinations account for 100 % of final grade.

Additional information

The course must be passed before graduation.

Responsible

Lars Bech Sørensen (LBS)

Valid from

8/1/2021 12:00:00 AM

Course type

Compulsory Course for all ICT Engineering
4. semester

Keywords

<div></div>