TDDB57 Data Structures and Algorithms (7 ECTS)
For C (Ht1 2006)
The aim
In every computer application data has to be stored and retrieved from computer memory. The question is then how to do this efficiently and using as little memory as possible. The course presents commonly used techniques which facilitate achievement of these goals.
The fundamental notions covered are:
- abstract data type (ADT): an ADT characterizes a data domain together with operations on data without specifying how the data are to be represented in the computer memory,
- data structure: a way of representing data
in computer
memory; we will discuss data structures suitable for efficient
implementation of commonly used ADTs
This course
- discusses commonly used abstract data types such as stacks, queues, dictionaries and graphs and shows data structures used in their implementation,
- introduces basic techniques for analysis of the algorithms on data structures,
- presents some fundamental algorithms on data structures, like searching and sorting.
