n1 - • Problem solving skills These are emphasized in the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 1 Course Outline CS70 is a course on ”Discrete Mathematics for Computer Scientists”. The purpose of the course is to teach you about: Fundamental ideas in computer science: - Boolean logic - Uncomputability and the halting problem - Modular arithmetic, error-correcting codes, secret sharing protocols - The power of randomization (“flipping coins”) in computation Many of these concepts underlie the more advanced courses in computer science. Precise, reliable, powerful thinking: - Proofs of correctness. These are essential to analyzing algorithms and programs - Induction and recursion - Probability theory
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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: error-correcting codes, secret sharing • Diagonalization, self-reference, 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.

Ask a homework question - tutors are online