This course has been designed to provide you with a clear, accessible introduction to discrete mathematics. Discrete mathematics describes processes that consist of a sequence of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. As you progress through the units of this course, you will develop the mathematical foundations necessary for more specialized subjects in computer science, including data structures, algorithms, and compiler design. Upon completion of this course, you will have the mathematical know-how required for an in-depth study of the science and technology of the computer age.

### Unit 1: The Logic of Comp...

This is Unit 1 from Saylor.org's Discrete Structures course.

### Unit 2: The Logic of Quan...

This is Unit 2 from Saylor.org's Discrete Structures course.

### Unit 3: Introduction to N...

This is Unit 3 from Saylor.org's Discrete Structures course.

### Unit 4: Mathematical Indu...

This is Unit 4 from Saylor.org's Discrete Structures course.

### Unit 6: Introduction to C...

This is Unit 6 from Saylor.org's Discrete Structures course.

### Unit 8: Graphs and Trees ...

This is Unit 8 from Saylor.org's Discrete Structures course.

### Unit 9: Regular Expressio...

This is Unit 9 from Saylor.org's Discrete Structures course