10.3-10.4 trees.ppt

10.5-minimum spanning trees.ppt

00 - DMS' Applications.ppt

00-Introduction.ppt

1.1-Propositional logic.ppt

1.2- Propositional equivalences.ppt

1.3&1.4- Predicates and Quantifiers.ppt

1.5- rules of inference.ppt

1.6&1.7- proof strategy.ppt

2.1&2.2- Sets and operations.ppt

2.3- Functions.ppt

2.4-Sequences and Summations.ppt

3.1- Algorithms.ppt

3.2&3.3-Growth of Functions.ppt

3.2-Growth of Functions.ppt

3.4- the integers and division.ppt

3.5- primes and greatest common division.ppt

3.6- integers and algorithms.ppt

3.8-matrices.ppt

4.1-4.3 Mathematical induction.ppt

5.1~3-counting.ppt

5.5~6-counting.ppt

6.1~6.2-Probability.ppt

6.3~6.4-Probability.ppt

7.1~7.2-advanced counting techniques.ppt

7.3-advanced counting techniques.ppt

7.4-Generating Functions.ppt

8.1~8.3-relations.ppt

8.6-relations.ppt

9.1~9.2 graphs.ppt

9.3 representing.ppt

9.4 connectivity.ppt

9.5-Euler and Hamilton Paths.ppt

9.6-shortest path.ppt

9.7-planar graph.ppt

9.8-graph colorings.ppt

10.1&10.2-trees.ppt