Key words
Objectives
To gain insight in solution methods for complex problems, graphs, computatonial geometry, combinatorial search and game strategies.
Topics
A survey of classical graph algorithms : depth and breadth first search, minimal spanning tree, shortest distances, acyclic graphs, flow networks and matching.
Introduction to computatonial geometry: basic techniques, convex hull, proximity, point location, geometric search, line segment intersection.
Introduction to combinatorial search and game strategies, backtracking, branch-and-bound, minimax, a-b pruning.
Prerequisites
Final Objectives
Materials used
::Click here for additional information::
Handouts
Study costs
Study guidance
Teaching Methods
Lectures
Assessment
However, if a student gains a score of 7 or less on 20 on one of the different courses (parts of training items), he proves that his skill for certain subcompetencies is insufficient. Consequently, one can turn from the arithmetical calculation of the final assignment of quotas of a training item and the new marks can be awarded on consensus. Of course the examiners can judge that the arithmetic regulations mentioned in the study index card can also be used for 7 or less. For each deviation a detailed motivation ought to be drawn up. In that case one should point out that the skill for this subcompetency is proven to be insufficient, if the student didn’t pass the partim that is considered to be important for certain subcompetencies.
Lecturer(s)
Jan CNOPS - Helga NAESSENS - Wijnand SCHEPENS - Rudy STOOP
|
|
