Key words
Objectives
Programs not using the appropriate techniques don't work properly.
This course helps to gain insight in the fundamental methods to store and process data efficiently.
Topics
An extensive survey of fundamental algorithms and data structures.
Various techniques to sort: insertion sort, Shell sort, heapsort, mergesort, quicksort, counting sort, bucket sort, sorting with files.
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, dynamic hashing.
String searching, data structures for strings.
Prerequisites
Final Objectives
Materials used
Handouts
Study costs
Study guidance
Teaching Methods
Lectures
Assessment
Lecturer(s)
Rudy STOOP, Leen BROUNS, Jan CNOPS
|
|
