a.An Introduction to Discrete Probability
d.Expected Value and Variance
2. Advanced Counting Techniques
a.Applications of Recurrence Relations.
b.Solving Linear Recurrence Relations.
c.Divide-and-Conquer Algorithms and Recurrence Relations.
f.Applications of Inclusion–Exclusion.
a.Relations and Their Properties.
b.n-ary Relations and Their Applications .
c. Representing Relations.
d.Closures of Relations.
a.Graphs and Graph Models.
b.Graph Terminology and Special Types of Graphs. .
c.Representing Graphs and Graph Isomorphism.
e.Euler and Hamilton Paths.
a.Introduction to Trees
b.Applications of Tree
e.Minimum Spanning Trees
6. Linked List, Stack, and Queue
b.Weak and strong induction
c.Recursive definitions of functions and sequences
a.Reflexivity, symmetry, transitivity
b.Operations, union, intersection, complement, projection, join
c.Composition and exponentiation
d. Equivalence relations and equivalence classes