Data Structures, 6 credits (TND004)
Datastrukturer, 6 hp
Main field of study
Computer Science and Engineering Media Technology and EngineeringLevel
First cycleCourse type
Programme courseExaminer
Aida NordmanDirector of studies or equivalent
Camilla Forsell| Course offered for | Semester | Period | Timetable module | Language | Campus | VOF | |
|---|---|---|---|---|---|---|---|
| 6CIEN | Electronics Design Engineering, M Sc in Engineering | 6 (Spring 2018) | 2 | 3 | Swedish | Norrköping | v |
| 6CMEN | Media Technology and Engineering, M Sc in Engineering | 6 (Spring 2018) | 2 | 3 | Swedish | Norrköping | o |
Main field of study
Computer Science and Engineering, Media Technology and EngineeringCourse level
First cycleAdvancement level
G2XCourse offered for
- Electronics Design Engineering, M Sc in Engineering
- Media Technology and Engineering, 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
Programming in C++Intended learning outcomes
The aim of the course is to give students the tools to independently be able to create programs that solve practical problems dealing with large amounts of data, taking into account efficient use of time and memory. Upon completion of the course the student should fulfill the following learning outcomes.
- To propose specific data structures and algorithms to address practical problems.
- To motivate objectively the choices made, concerning chosen data structures, and relate to the known scientific results in the field.
- To analyze the trade offs, regarding efficiency in several aspects, of different data structures proposed for addressing a practical problem.
- To implement and use the data structures and algorithms in application programs.
Course content
Algorithm analysis. Recursion. Lists, stacks and queues. Trees and tree traversals. Binary search trees, threaded trees and balanced trees. Hashing and hash tables. Priority queues and binary heaps. Sorting och searching. Indexed files. Graphs and graph traversals. Fundamental graph algorithms.
Teaching and working methods
Lectures, lessons, and laboratory work.
Examination
| TEN1 | Written examination | U, 3, 4, 5 | 3 credits |
| LAB1 | Laboratory work | U, G | 3 credits |
Grades
Four-grade scale, LiU, U, 3, 4, 5Department
Inst f teknik och naturvetenskap (Nkpg)Director of Studies or equivalent
Camilla ForsellExaminer
Aida NordmanCourse website and other links
http://www2.itn.liu.se/utbildning/kurs/index.html?coursecode=TND004Education components
Preliminary scheduled hours: 60 hRecommended self-study hours: 100 h
Course literature
Data Structure and Algorithm Analysis in C++, Mark Allen Weiss, Addison Wesley, 4th edition, year 2014.Data Structure and Algorithm Analysis in C++, Mark Allen Weiss, Addison Wesley, 4th edition, year 2014.
| TEN1 | Written examination | U, 3, 4, 5 | 3 credits |
| LAB1 | Laboratory work | U, G | 3 credits |
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.