Key words
Objectives
Programs not using the appropriate techniques don't link properly.
This course helps to gain insight in the fundamental methods to store and process data efficiently.
Prerequisites
Topics
An extensive survey of most fundamental algorithms and data structures.
Various techniques to sort: insertion sort, Shell sort, heapsort, mergesort, quicksort, counting sort, bucket sort, sorting with fibes.
Fundamental data structures: lists, stacks, queues, priority queues, trees.
A survey of important data structures: hashtables, binary search trees, efficient binary search trees (red-black trees, splay trees, treaps), b-trees.
Search algorithm in strings.
Teaching Methods
Materials used
Study guidance
Assessment
Study costs
Lecturer(s)
Rudy STOOP
Language
Dutch
|
|
