Data Structures and Algorithms, 6 credits (TDDC91)

Datastrukturer och algoritmer, 6 hp

Main field of study

Information Technology

Level

First cycle

Course type

Programme course

Examiner

Erik Nilsson

Director of studies or equivalent

Ola Leifler
Course offered for Semester Period Timetable module Language Campus VOF
6CITE Information Technology, M Sc in Engineering 3 (Autumn 2018) 1 3 Swedish Linköping o

Main field of study

Information Technology

Course level

First cycle

Advancement level

G1X

Course offered for

  • Information Technology, M Sc in Engineering

Entry requirements

Note: Admission requirements for non-programme students usually also include admission requirements for the programme and threshold requirements for progression within the programme, or corresponding.

Prerequisites

Basic knowledge of programming in Java and basic knowledge in discrete mathematics and calculus.

Intended learning outcomes

The purpose of the course is to give the student tools to independently be able to construct computer programs that use time and memory in an efficient way. Upon completion of the course the student shall be able to:

  • demonstrate ability to analyze time and space complexity of iterative and simple recursive algorithms.
  • explain and use the most common abstract data types and sorting algorithms.
  • implement the most common abstract data types with different data structures and algorithms.
  • describe established methods for design (and analysis) of algorithms in general.

Course content

  • Basic notions
  • Mathematical foundations for analysis of algorithms
  • Fundamental abstract data types and data structures, such as lists, stacks, queues, search trees, hash tables and graphs
  • Efficiency analysis of algorithms
  • Sorting and searching
  • Algorithm paradigms

Teaching and working methods

The lectures present the theory. The tutorials are devoted to individual work with exercises illustrating the theory. The laboratory assignments concern computer implementation of the techniques presented in the lectures.

Examination

BAS1Work in PBL-groupU, G1 credits
DAT1Computer examinationU, 3, 4, 52 credits
UPG1Voluntary assignmentU, G0 credits
LAB1Laboratory workU, G2 credits
UPG2Computer hand-in assignmentU, G1 credits
UPG1 is comprised of a collection of voluntary programming assignments that, if they are solved, give bonus points towards the course's written examination (only the first offering).

Grades

Four-grade scale, LiU, U, 3, 4, 5

Other information

Design and Analysis of Algorithms. Complexity Theory

Department

Institutionen för datavetenskap

Director of Studies or equivalent

Ola Leifler

Examiner

Erik Nilsson

Course website and other links

http://www.ida.liu.se/~TDDC91/

Education components

Preliminary scheduled hours: 52 h
Recommended self-study hours: 108 h
There is no course literature available for this course.
BAS1 Work in PBL-group U, G 1 credits
DAT1 Computer examination U, 3, 4, 5 2 credits
UPG1 Voluntary assignment U, G 0 credits
LAB1 Laboratory work U, G 2 credits
UPG2 Computer hand-in assignment U, G 1 credits
UPG1 is comprised of a collection of voluntary programming assignments that, if they are solved, give bonus points towards the course's written examination (only the first offering).

This tab contains public material from the course room in Lisam. The information published here is not legally binding, such material can be found under the other tabs on this page. There are no files available for this course.

Page responsible: Info Centre, infocenter@liu.se