Professional Documents
Culture Documents
I guess you know at least one programming language and concepts like object and
pointer.Algorithms and data structures will be listed in terms of their complexity.
Consider graphs
A list of adjacent vertices of a graph, an adjacency matrix of a graph, Weighted edges
of a graph
Basic bypass algorithms - Search in width, Search in depth, etc.
Shortest Path Finding Algorithms - Dijkstra Algorithm, Floyd-Worshell Algorithm,
Bellman-Ford Algorithm
The minimal spanning tree is the Kruskal Algorithm, the Prima Algorithm
By now you should be very familiar with programming, because you need to know more than the
student for further reading and deepening in this topic.
Higher Mathematics
Fast Fourier Transform
Simplicity check
Computational geometry - The problem of finding the nearest pair, Voronoi diagram,
Convex hull of the set of points