Week 1: Introduction - Elementary Data and Control Structures in C (8)

At the end of this course you should be able to:

choose/develop effective data structures (DS)
(graphs, search trees, …)
choose/develop algorithms (A) on these DS
(graph algorithms, tree algorithms, string algorithms, …)
analyse performance characteristics of algorithms
package a set of DS+A as an abstract data type
develop and maintain C programs