Discrete Mathematics for Computer Science

The goal of this lecture note is to introduce students to ideas and
techniques from discrete mathematics that are widely used in Computer
Science. This note covers the following topics: Propositional logic,
Induction, Strong induction, Structural induction, Proofs about algorithms,
Algebraic algorithms, Number theory, RSA, Basics of counting, basic
probability,Conditional probability, Linearity of expectation, variance.

**Author(s):** Mike Clancy, David Wagner

NA Pages