Course syllabus

Algoritmer, datastrukturer och komplexitet
Algorithms, Data Structures and Complexity

EDAF05, 5 credits, G2 (First Cycle)

Valid for: 2016/17
Decided by: Education Board A
Date of Decision: 2016-04-05

General Information

Main field: Technology.
Compulsory for: D2, Pi4-pv
Elective for: E4, F4, F4-pv
Language of instruction: The course will be given in English on demand

Aim

Algorithms and data structures are fundamental in computer science. Data structures are used to model reality and the choice of data structures affects the efficiency of algorithms. One aim with this course is to give the students knowledge of advanced data structures for some of the abstract models included in previous courses and also of a number of data structures used to represent further models, such as graphs. Another aim is to give improved knowledge of algorithms, particularly graph algorithms. The course will also give the students knowledge of techniques for analysing algorithms with respect to performance.

Learning outcomes

Knowledge and understanding
For a passing grade the student must

Competences and skills
For a passing grade the student must

Judgement and approach
For a passing grade the student must

Contents

Graphs and graph algorithms. Data structures for graphs. Problem solving strategies such as divide and conquer, greedy algorithms and brute force. Techniques for analysing the time complexity of algorithms. Introduction to the complexity classes P and NP, computability and the Church-Turing thesis.

Examination details

Grading scale: TH
Assessment: Written exam. The final grade of the course is based on the result of the written exam. For a passing grade of the course the compulsory course items must be completed.

Parts
Code: 0109. Name: Written Examination.
Credits: 3. Grading scale: TH. Assessment: The final grade of the course is based on the result of the written exam.
Code: 0209. Name: Compulsory Course Items.
Credits: 2. Grading scale: UG. Assessment: For a passing grade, the compulsory course items must be completed. Contents: Laboratory work and a hand-in assignment.

Admission

Admission requirements:

The number of participants is limited to: No
The course overlaps following course/s: EDA027, EDA690

Reading list

Contact and other information

Course coordinator: Professor Thore Husfeldt, Thore.Husfeldt@cs.lth.se
Course homepage: http://cs.lth.se/edaf05