contents
1. BASIC CONCEPTS
Sets and Sequences.
Mathematical Induction.
2. analysis of algorithms
Cost models.
Run-time analysis.
Big-O notation.
Complexity of algorithms and complexity of problems.
3. graphs
Matrix representation of a graph. Matrix adjacencies
Determination of the number of paths of length k, between two vertices
Transitive closure of an array of surroundings
Euler Paths. Fleury algorithm
Weighted Graphs. Dijkstra's algorithm
Minimum cost of generating trees. Kruskal's Algorithm
Graphs and Maps Coloring
4. information theory
Basic concepts
Encoding Algorithms