CS 70 Spring 2024
Lecture: TuTh 3:30pm - 5:00pm, Dwinelle 155 Jump to current week Introduction, Propositional Logic Proofs Induction Induction, Stable Matching Graphs Graphs Modular Arithmetic Euclid, FLT, CRT RSA Polynomials, Secret Sharing Error Correcting Codes Countability Computability, Counting Counting No lecture Midterm (7-9pm) Introduction to Discrete Probability Conditional Probability, Independence Some Applications Random Variables and Expectation Geometric and Poisson Distributions Spring Break Spring Break Variance Concentration Inequalities Continuous Probability Continuous Probability Markov Chains Markov Chains Prediction Randomized Algorithms RRR Week RRR Week Final Exam (7-10pm)
Week Date Lecture Resources Notes Discussion Homework 0 Thu 8/27 Direct Proofs lecture full Note 0 Note 1 HW 0, solutions 1 Tue 9/1 Propositional Logic & Proof Techniques lecture Note 2 Disc 0, solutions HW 1, solutions Thu 9/3 Proof Techniques II lecture Note 3 Fri 9/4 Quiz 0: Direct Proofs 2 Tue 9/8 Induction lecture Note 4 Disc 1, solutions HW 2, solutions Thu 9/10 Modular Arithmetic lecture Note 5 Fri 9/11 Quiz 1: Propositional Logic, Proof Techniques 3 Tue 9/15 Euclid, FLT, CRT Disc 2, solutions HW 3, solutions Thu 9/17 RSA Fri…
saved by
related reading
- 6.5840 Schedule: Spring 2026pdos.csail.mit.edu
- Fall 2026boazbk.github.io
- 15-855: Graduate Computational Complexity Theory, Fall 2017cs.cmu.edu
- CS 70 Fall 2026eecs70.org
- HTMAA 2025fab.cba.mit.edu
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca
- CS109: Probability for Computer Scientists, Winter 2023web.stanford.edu
- Graduate 2026/2027 Timetable - Department of Computer Science, University of Torontoweb.cs.toronto.edu
- CSE 599 Counting and Samplinghomes.cs.washington.edu
- MIT 6.S976 and 18.S996 Cryptography and Machine Learning (Spring 2026)mlcrypto.mit.edu
- info21a.pdfweb.mit.edu
- Syllabuscs230.stanford.edu