Unformatted text preview: • Problem solving skills: These are emphasized in the discussion sections and homeworks. Course outline (abbreviated). • Propositions, propositional logic and proofs • Mathematical induction, recursion • The stable marriage problem • Modular arithmetic • Polynomials and their applications: errorcorrecting codes, secret sharing • Diagonalization, selfreference, and uncomputability • Probability and probabilistic algorithms: load balancing, hashing, expectation, variance, Chebyshev and Chernoff bounds, conditional probability, Bayesian inference, law of large numbers. CS 70, Spring 2008, Note 1 1...
View
Full
Document
This note was uploaded on 04/09/2008 for the course CS 61A taught by Professor Harvey during the Spring '08 term at Berkeley.
 Spring '08
 Harvey
 Computer Science

Click to edit the document details