Goals:
The aims of this course are to provide the students with knowledge of algorithms and data structures and with experience in their development and analysis.
Contents:
Data Structures: lists, trees, hashtabels, skip-lists.
Data Abstractions: stacks, queues, priority queues, dictionaries, sets
Algorithms: searching, sorting, selection, merging, string matching
Graph Algorithms: graphtraversal, connectivity, topological sorting, spanning trees, shortest paths, transitive closure
Paradigms: divide-and-conquer, dynamic programming, greedyness
Abnalysis and synthesis: worstcase, amortised and expected execution time; assertions, invariants, validity, termination and correctness
Literature:
To be announced
Evaluation
Written examination, 4 hours, 13-scale
Lecturer:
Erik Meineche Schmidt
Credits:
2 points, 10 ECTS
Semester
Spring