Search programme

​Use the search function to search amongst programmes at Chalmers. The study programme and the study programme syllabus relating to your studies are generally from the academic year you began your studies.

Syllabus for

Academic year
TDA416 - Data structures and algorithms  
Datastrukturer och algoritmer
 
Syllabus adopted 2018-02-28 by Head of Programme (or corresponding)
Owner: TKITE
7,5 Credits
Grading: TH - Five, Four, Three, Fail
Education cycle: First-cycle
Major subject: Information Technology
Department: 37 - COMPUTER SCIENCE AND ENGINEERING


Teaching language: Swedish
Open for exchange students: No

Course module   Credit distribution   Examination dates
Sp1 Sp2 Sp3 Sp4 Summer course No Sp
0105 Examination 7,5c Grading: TH   7,5c   15 Jan 2019 pm SB_MU   24 Apr 2019 pm H   22 Aug 2019 am SB  
0205 Laboratory 0,0c Grading: UG   0,0c    

In programs

TKELT ELECTRICAL ENGINEERING, Year 3 (compulsory elective)
TKITE SOFTWARE ENGINEERING, Year 2 (compulsory)
MPSYS SYSTEMS, CONTROL AND MECHATRONICS, MSC PROGR, Year 1 (elective)

Examiner:

Erland Holmström

  Go to Course Homepage

Replaces

TDA415   Data structures


Eligibility:

In order to be eligible for a first cycle course the applicant needs to fulfil the general and specific entry requirements of the programme(s) that has the course included in the study programme.

Course specific prerequisites

Programming courses in basic object-oriented programming.
Basic mathematical concepts as sets, functions, relations graphs, logarithms and proof by induction.

Aim

To understand how to store and manage large amount of data effectively. Furthermore how to analyse the efficiency of different methods of storing data.

Learning outcomes (after completion of the course the student should be able to)

- understand and use basic data structures as stacks, queues, tables and graphs;
- use the algorithms connected to efficient data strucktures and understand why they are correct;
- analyze the efficiancy of the algorithms;
- make motivated choices between different data structures for different applications.

The student should also in practice be able to:
- implement abstrakt data types as Java interfaces and data structures;
- analyze the efficiency of different implementations, for exampel sorting algorithms;
- use the standard library of data structures and algorithms;

Content

Abstract datatypes, simple analysis of imperative code. Common data structures, such as arrays, lists, trees and (hash)tables, usage of these data structures to implement stacks, queues, prority queues, lexica and graphs and other abstract datatypes. Standard algorithms on these structures. Common techniques for algorithm design. Standard algorithms libraries.

Organisation

Lectures, exercise classes, and laborations.

Literature

See course homepage.

Examination including compulsory elements

Laborations and written exam.


Published: Mon 28 Nov 2016.