6120a Discrete Mathematics And Proof For Computer Science Fix __full__ Jun 2026

| Week | Topic | |------|-------| | 1 | Propositional logic, truth tables | | 2 | Predicate logic, quantifiers | | 3 | Proof strategies (direct, contrapositive, contradiction) | | 4 | Mathematical induction | | 5 | Sets, relations, functions | | 6 | Number theory & modular arithmetic | | 7 | Combinatorics: counting, permutations, combinations | | 8 | Binomial theorem, pigeonhole principle | | 9 | Recurrence relations | | 10 | Graph theory basics, connectivity | | 11 | Trees, spanning trees | | 12 | Finite automata (optional introduction) | | 13 | Review & applications (e.g., RSA, graph coloring) | | 14 | Final exam |

Skipping logical steps in a proof because a conclusion "feels" obvious.

Topics: * Notions of implication, double implication, equivalence, converse, inverse, contrapositive, negation, and contradiction. Williams College Discrete Mathematics Course for Beginners | Week | Topic | |------|-------| | 1

Conquering 6120A is about a transformation in thinking. It's about moving from a mindset of "this is confusing" to "I can break this down." By mastering the core concepts, diligently practicing proof techniques, and adopting a disciplined study approach, you can not only succeed but excel. The skills you build in this course are not just for passing an exam; they are the very foundation of a successful career in computer science. Now go forth and prove it.

To ensure students grasp the "Fix" (rigorous nature) of the subject, the course employs: It's about moving from a mindset of "this

Assume the opposite of what you want to prove, then show it leads to an impossible situation.

: Using vertices and edges to model networks, paths, and relationships. To ensure students grasp the "Fix" (rigorous nature)

: Students learn to translate human language into precise formal notation using operators like ∧logical and ∨logical or (IMPLIES).

"CS 6120A: Discrete Mathematics and Proof for Computer Science" is a foundational course that covers the mathematical tools and proof techniques essential for high-level computing