TNDE11 Data Structures and Algorithms, 6 ECTS-points
/Datastrukturer och algoritmer/

Advancement level:
B

Aim:
The course is intended to give basically knowledge of abstract datatypes, data and how to implement them in C++.

Prerequisites:
Basic knowledge in programming and the progrmming language C++

Course organization:
The teaching consists of 34 h lectures and 24 h laboratory work. During the lectures the teoretical part of the course is presented.

Course content:
Abstract datatypes: specification, implementation, object-oriented languages Data structures: vectors, records, lists, stacks, queues, hashtabels, trees, filestructures, implementation in C++. Algorithms such as searching, sorting, analyse of efficiency of algoritms.

Course literature:
M A Weiss: Data Structures and Algorithm Abalysis in C++, Benjamin/Cummings Publishing Company. Some book on C++ e.g. Dietel/Dietel: C++ How to program, Prentice Hall or Skansholm: C++ direkt, Studentlitteratur. Course compendium.

TEN1Written examination, 3 p.
LAB1Labratory work, 1 p.
Course language is swedish.