## expected variable## expected value with large outcomes## Geometric Distribution## Expected value IRV
Theorem ## Variance
Variance => how widely the values of expected value of a random value is distributed. Variance of the number of successes in n Bernoulli trials is npq, where q is 1 - p |
## Chebyshev's Inequality## Equivalence Relation## Graph Terminology## Bipartite Rules for Special Simple Graphs## Strong vs Weak conn.
Strongly connected graph is also weakly connected. Look for strong components (vertices and cycles) |
## Euler Circuit Rules for Spec. Graphs## Euler circuit |

Cheatography
https://cheatography.com

# EECS 203 Final Exam Cheat Sheet Cheat Sheet by Kalbi

Final exam cheat sheet.

## Created By

## Metadata

## Favourited By

## Comments

No comments yet. Add yours below!

## Add a Comment

## Related Cheat Sheets

EECS 203 Exam 1 Cheat SheetEECS 203 Exam 2 Cheat SheetSorting algorithms Cheat Sheet## More Cheat Sheets by Kalbi

EECS 203 Exam 1 Cheat SheetEECS 203 Exam 2 Cheat Sheet