Course page for CS1310 - Discrete Structures 1
Back to my teaching page

Syllabus:

Part 1: Proofs and propositional logic
Part 2: Proof techniques: Direct proofs, proof by contradiction, case analysis, extremal elements, pigeon-hole principle, invariants, mathematical induction/well-ordering principle/minimum counter-example
Part 3: Mathematical data types: Sets, sequences, relations and functions, recursion
Part 4: Number theory

Resources:

Lecture Notes on Mathematics for Computer Science by Eric Lehman, Thomson Leighton and Albert Meyer (The first 9 chapters)
How to write mathematics - A guide by Martin Erickson
Discrete Mathematics: An Open Introduction Free open-source textbook by Oscar Levin

Reference Books:

1. Discrete Mathematics and its Applications by Kenneth Rosen
2. Discrete Mathematics with Applications by Susanna S. Epp

Assignments

Division of credit:

Attendance: 10%, Assignments: 10%, Quizzes: 15%, Exam 1: 25%, Exam 2: 40%

Academic Honesty Policy