Algoritmer och datastrukturer I
A revised version of the syllabus is available.
In order to pass, the student must be able to
Mathematical foundations: asymptotic notation, summations, recurrence relations.Data structures: trees, priority queues, heaps.Searching: binary search trees, balanced search trees, hash tables.Sorting: merge sort, quick sort, heap sort.Graph algorithms: depth first and breadth first search.Implementation of algorithms and data structures.
Lectures, laboratory work, lessons, and mandatory assignments.
Written exam (4 p). Assignments (1 p).
The unit cannot be included in a degree with Program Design II (1IT022), nor with Data Structures (1DL009, 1TD191, 1MB026).
week 27, 2009
Read more about cookies.