Useful Links
Mathematics
Discrete Mathematics
1. Foundations of Logic and Proofs
2. Set Theory and Basic Structures
3. Combinatorics
4. Number Theory
5. Graph Theory
6. Trees
7. Discrete Probability
8. Algorithms and Complexity
9. Boolean Algebra and Logic Circuits
Discrete Probability
Probability Foundations
Sample Spaces
Finite Sample Spaces
Events and Outcomes
Event Operations
Probability Axioms
Kolmogorov Axioms
Basic Properties
Probability Assignment
Counting and Probability
Equally Likely Outcomes
Classical Probability
Combinatorial Probability
Conditional Probability
Definition and Calculation
Conditional Probability Formula
Multiplication Rule
Tree Diagrams
Independence
Independent Events
Mutual Independence
Pairwise Independence
Bayes' Theorem
Statement and Proof
Prior and Posterior Probabilities
Law of Total Probability
Partition of Sample Space
Random Variables
Discrete Random Variables
Definition and Examples
Probability Mass Function
Cumulative Distribution Function
Expected Value
Definition and Calculation
Linearity of Expectation
Expected Value of Functions
Variance and Standard Deviation
Definition and Calculation
Properties of Variance
Computational Formulas
Common Discrete Distributions
Bernoulli Distribution
Binomial Distribution
Geometric Distribution
Poisson Distribution
Applications and Advanced Topics
Markov Chains
State Spaces and Transitions
Transition Matrices
Steady-State Behavior
Probabilistic Algorithms
Randomized Algorithms
Monte Carlo Methods
Las Vegas Algorithms
Information Theory Basics
Entropy
Information Content
Applications to Coding
Previous
6. Trees
Go to top
Next
8. Algorithms and Complexity