from Guide to Undergraduate

Discrete Mathematics & Probability Theory

I found the course challenging but ended up surviving, going on to head TA for it 3x. Here is a step-by-step guide for you to do the same or better.

Start by reading the tips below.

• How to write a proof
• How to fix a proof
• To maximize lecture, listen like you're about to reteach it.

Cheat Sheets

During lectures, anticipate the next step, live. If you don't attend lecture, at minimum, read course notes -- still with the same goal of anticipation. Then, after lecture, review the crib sheet, and take a quiz with an exam mindset.

• Propositional Logic Crib Quiz Sol Quiz Sol
• Induction Crib QuizSol QuizSol
• Stable Matching Algorithm Crib QuizSol QuizSol
• Graph Theory Crib QuizSol QuizSol
• Hypercube QuizSol
• Eulerian Tour QuizSol
• Modular Arithmetic Crib QuizSol QuizSol
• Fermat's Little Theorem, RSA Crib QuizSol QuizSol
• RSA, Polynomials Crib QuizSol QuizSol
• Secret Sharing QuizSol
• Error Correction Crib QuizSol
• Countability Crib QuizSol QuizSol
• Computability Crib QuizSol QuizSol
• Counting Crib QuizSol QuizSol
• Stars and Bars QuizSol
• Conditional Probability Crib QuizSol QuizSol
• Expectation QuizSol
• Independence QuizSol Quiz Sol
• Bayes' Rule Crib QuizSol
• Distributions Crib QuizSol QuizSol
• Linearity of Expectation Crib QuizSol QuizSol
• Inequalities Crib QuizSol
• Linear Regression Crib QuizSol QuizSol
• Conditional Expectation Crib QuizSol QuizSol
• Markov Chain Concepts Crib QuizSol
• Markov Chain Problems Crib QuizSol
• Confidence Intervals QuizSol
• Continuous Probability Crib QuizSol
• Continuous Probability II Crib QuizSol

Exams

Make sure to take practice exams beforehand. Here are additional practice questions to use.

• Midterm 1 Practice QuestionsSol
• Midterm 2 Practice QuestionsSol

The marks the end of the guide. Best of luck with your final exam! Use the exam tactics we covered above, and take stock of all the "rules" you've collected throughout the semester.

For semester-specific resources, see the Spring 2016 or Fall 2016 pages.

Applications

Here are some applications of the above to various topics.

• How to identify a fake 2048 score - induction proofs
• Why 4=10 has exactly 500 levels - combinatorics

← back to Guide to Undergraduate