CS 55 at Pomona College is an introduction to discrete mathematics: the study of logic, set theory, inductive structures, the natural numbers and integers, counting, probability, and graph theory. We could have called the course “how to think like a computer scientist”.

From the course catalog:

Introduction to the study of finite mathematical structures and the ways to build them, count them and analyze them. Topics and examples chosen to relate to concepts of interest in the design and analysis of computer algorithms, including permutations and combinations, graphs and trees and codes. Emphasis on creative problem solving and learning to read and write proofs.

Or, from Bertrand Russell, as discrete a mathematician as you might find:

The eternal world is trivial, and … mathematics is only the art of saying the same thing in different words.

Prerequisites: CS 51 or equivalent (AP CS, CS 5 at Mudd, or significant programming experience).

Office hours and mentor sessions

The entries here are ordered by increasing closeness to assignment due dates (Wednesdays in class).

I’m available at other times by appointment—send me an email.

Meetings

Please note that the chapter numbers for readings are for Rosen’s 7th Edition.