 |

Discrete Math for Computer Science Government |
|
Outline
Set Theory
- Sets and Subsets
- Operations on Sets
- Cardinality of Sets
- Venn Diagrams & Applications
Counting Techniques
- Multiplication Principle
- Permutations and Combinations
- More Permutations and Combinations
- Pigeonhole Principle
Discrete Probability
- Probability of a Simple Event
- Probability of a Compound Event
- Bayes’ Theorem
- Expected Value
Graph Theory
- Graphs and Representations
- Number of Paths Between Two Vertices
- Euler Paths and Circuits
- Eulerizing a Graph
Logic
- Simple and Compound Statements
- Basic Truth Tables
- Algebra of Statements and Logical Equivalence
- Logical Arguments
- Gates and Three-Way Switches
Basic Number Theory
- Place-Value System
- Conversions
- Binary Addition and Subtraction
- Greatest Common Divisor (GCD)
|
|
 |