Skip to content


COURSE SYLLABUS

Data structures and algorithms 7.5 credits

Datastrukturer och algoritmer
First cycle, D0041D
Version
Course syllabus valid: Spring 2022 Sp 4 - Present
The version indicates the term and period for which this course syllabus is valid. The most recent version of the course syllabus is shown first.


Education level
First cycle
Grade scale
G U 3 4 5
Subject
Computer Science
Subject group (SCB)
Computer Technology

Entry requirements

In order to meet the general entry requirements for first cycle studies you must have successfully completed upper secondary education and documented skills in English language


More information about English language requirements


Selection

The selection is based on 1-165 credits.



Course Aim
After course completion, the student should be able to demonstrate:
  1. knowledge about a) the scientific foundation for developing and analysing algorithms and data structures that accurately and efficiently solve different problems and b) the proven experience programmers in  this field of Computer Science;
  2. ability to create, analyse and critically evaluate various technical solutions for evaluating computer software in situations when they become so complex that they are not transparent;
  3. ability to plan and use appropriate methods to undertake advanced programming tasks within predetermined parameters.

Contents
This course provides skills in algorithmic problem solving. The course includes algorithms and data structures, especially for searching and sorting of large data sets and graphical problems. Queues, stacks, lists, priority queues, trees and search trees, graphs, sets, and tables and recurrence equations, efficiency analysis and upper limits. Analysis of asymptotic time and memory complexity for algorithms.

Realization
Each course occasion´s language and form is stated and appear on the course page on Luleå University of Technology's website.
Lectures and laboratory work. In the practical lab work we use an object oriented programming language (usually C++).

Examination
If there is a decision on special educational support, in accordance with the Guideline Student's rights and obligations at Luleå University of Technology, an adapted or alternative form of examination can be provided.
Examination consists of a final written exam and mandatory programming assignments.
The course objectives are examined as follows:
  1. Final written exam. Individual lab assignments;
  2. Final written exam. Individual lab assignments;
  3. Lab assignments.

Examiner
Jingsen Chen

Literature. Valid from Spring 2016 Sp 3 (May change until 10 weeks before course start)
Mark A. Weiss: Data Structures & Algorithm Analysis in C++, 4th Edition, Pearson, 2013. ISBN-10: 013284737X, ISBN-13: 978-0132847377

Course offered by
Department of Computer Science, Electrical and Space Engineering

Modules
CodeDescriptionGrade scaleCrStatusFrom periodTitle
0002Laboratory workU G#3.00MandatoryS10
0003Written examG U 3 4 54.50MandatoryS22

Study guidance
Study guidance for the course is to be found in our learning platform Canvas before the course starts. Students applying for single subject courses get more information in the Welcome letter. You will find the learning platform via My LTU.

Syllabus established
by LTU Skellefteå 19 Nov 2008

Last revised
by Jonny Johansson, HUL SRT 14 Jan 2022