These activities were developed by Jim Van Horn for Discrete Structures.
For access, see these Google Drive folders for Discrete 1 and Discrete 2.
Discrete Structures 1
| Stage |
Activity Name |
| 3: Refined |
01. Group Roles and the Problem Solving Process |
| 3: Refined |
02. Sequences and Series |
| 3: Refined |
03. Propositions and Truth Tables |
| 3: Refined |
04. Predicates |
| 3: Refined |
05. Multiple Quantifiers and Negation |
| 3: Refined |
06. Implications |
| 3: Refined |
07. Converse, Inverse, Contrapositive |
| 3: Refined |
08. Mathematical Writing |
| 3: Refined |
09. Proofs About Numbers |
| 3: Refined |
10. Proofs by Mathematical Inducation |
| 3: Refined |
11. Proofs by Contradiction |
| 3: Refined |
12. Number Systems |
| 3: Refined |
13. Introduction to Sets |
| 3: Refined |
14. More Operations on Sets |
| 3: Refined |
15. Power Sets and Partitions |
| 3: Refined |
16. Set Properties and Boolean Algebra |
| 3: Refined |
17. Logic Circuits |
| 3: Refined |
18. Introduction to Functions |
| 3: Refined |
19. Composition Operation |
| 3: Refined |
20. Properties of Functions |
| 3: Refined |
21. Properties of Relations |
| 3: Refined |
22. Numeric Functions |
Discrete Structures 2
| Stage |
Activity Name |
| 3: Refined |
5.1. Intro to Combinatorics |
| 3: Refined |
5.2. Rules of Product and Sum |
| 3: Refined |
5.2. More Counting and Permutations |
| 3: Refined |
5.3. Combinations |
| 3: Refined |
5.3. Binomial Theorem |
| 3: Refined |
5.4. Binary Sequences |
| 3: Refined |
5.4. Generalized Rules for Counting |
| 3: Refined |
5.5. Recursive Counting |
| 3: Refined |
5.5. More Counting |
| 3: Refined |
5.6. Difference Tables |
| 3: Refined |
5.6. Other Types of Recurrence Relations |
| 3: Refined |
6.1. Probability |
| 3: Refined |
6.2. Sum and Product Rules |
| 3: Refined |
7.1. Graph Theory |
| 3: Refined |
7.2. Introduction to Trees |
| 3: Refined |
7.2. Minimal Spanning Trees |
| 3: Refined |
7.3. Graph Isomorphism |
| 3: Refined |
7.3. Planar Graphs |
| 3: Refined |
7.3. Matrices and Directed Graphs |
| 3: Refined |
7.4. Directed Graphs and Relations |
| 3: Refined |
7.5. Graphs in Puzzles and Games |
| 3: Refined |
7.6. Binary Trees |
| 3: Refined |
7.6. Sorting and Traversing Trees |
| 3: Refined |
7.7. Hamiltonian Cycles |
| 3: Refined |
7.7. Approximate Solutions to the TSP |
These activities were developed by Clif Kussmaul for Discrete Structures and/or Intelligent Systems.
For access, contact Clif Kussmaul.
| Stage |
Activity Name |
|---|
| 3: Refined |
Probability & Statistics |
| 3: Refined |
Logic I: Propositional Logic; II: First-Order Logic |
