Study Guide@lith   Link to LiU Homepage

Linköping Institute of Technology

Link to LiU Homepage
Valid for year : 2010
TND004 Data Structures, 6 ECTS credits.

For:   MT  


Prel. scheduled hours:
Rec. self-study hours: 160

  Area of Education: Technology

Main field of studies: Computer Engineering

  Advancement level (G1, G2, A): G2

The course gives a solid knowledge of fundamental data structures and their accompanying algorithms. The course also presents efficient techniques for sorting and searching, including file management. In addition efficiency of algorithms is discussed. Upon completion of the course the student should be able to:
  • propose specific data structures to address practical problems.
  • analyze the trade offs, regarding efficiency in several aspects, of different data structures proposed for addressing a practical problem.
  • implement and use the data structures and algorithms in application programs.

Prerequisites: (valid for students admitted to programmes within which the course is offered)
Programming in C++

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

Lectures, lessons, laboratory work.

Course contents:
Trees and tree traversals. Search trees and balanced trees. Hashing and hash tables. Priority queues and heaps. Sorting and searching. Indexed files and external sorting. Text processing. Graphs and graph traversals. Fundamental graph algorithms.

Course literature:
To be decided.

Written examination
Laboratory work.

Course language is Svenska.
Department offering the course: ITN.
Director of Studies: Kenneth Bjerner
Examiner: Jan Petersson
Link to the course homepage at the department

Linköping Institute of Technology

Link to top of pagep

Contact: TFK ,
Last updated: 04/28/2010