CSE 20: Discrete Mathematics for Computer Science

CSE 20: Discrete Mathematics for Computer Science at UC San Diego

Welcome to CSE20! If you ever wondered "What sort of mathematics do I need for computer science?", this course will provide some of the answers. In particular, you will have the opportunity to learn basic concepts about algorithms, computer arithmetic, number systems, Boolean algebras, logic, proofs, program correctness, modular arithmetic, linear and partial orders, recurrences, and induction, amongst other things. In this class, you will use careful mathematical modeling, problem solving, and clear and precise communication to explore key questions in Computer Science. (1) How do we decide (and prove) what's true? (2) How do we use mathematics to give multiple representations of data and computation?

Prerequisites

There are no strict prerequisites but students should have a basic understanding of elementary computer programming, mathematics (algebra, geometry, trigonometry and calculus.)

Important course sites

canvas.ucsd.edu is our material repo and gradebook.
gradescope.com is our homework submission site.
piazza.com is our discussion and Q&A forum
course syllabus and schedule: https://canvas.ucsd.edu/courses/58077/assignments/syllabus - detailed version: Course Syllabus

Course Schedule

Week	Date	Topic	Assignments
1	Monday, Aug 5	Introduction to Discrete Mathematics 📋 slides	❓ Exit Ticket 1 \| 📝 HW1
	Tuesday, Aug 6	Mathematical Objects	❓ Exit Ticket 2
	Wednesday, Aug 7	Number representaion, Functions, Recursively defined sets (Chapters in Rosen's: 4.2)	❓ Exit Ticket 3
	Thursday, Aug 8	Number representation, Algorithms (Chapters in Rosen's: 4.2 and 3)	❓ Exit Ticket 4
2	Monday, Aug 12	Circuits, fixed-width operations in circuits (Chapters in Rosen's: 12.4)	❓ Exit Ticket 5 \| 📝 HW2
	Tuesday, Aug 13	Circuits cont., Logical operations, Truth tables, DNF/CNF, Propositions, Logical equivalences (Chapters in Rosen's: 1 and 12.4)	❓ Exit Ticket 6
	Wednesday, Aug 14	Logical operations, Translation, Consistency, Predicates (Chapters in Rosen's: 1)	❓ Exit Ticket 7
	Thursday, Aug 15	r Logical equivalence and consistency cont., Predicates, Quantifiers (Chapters in Rosen's: 1)	❓ Exit Ticket 8
3	Monday, Aug 19	Predicates, Quantifiers, Sets proof (Chapters in Rosen's: 1.7, 1.8 and 2)	❓ Exit Ticket 9 \| 📝 HW3
	Tuesday, Aug 20	Sets proof (Chapters in Rosen's: 1.8 and 2)	❓ Exit Ticket 10
	Wednesday, Aug 21	Sets proofs, divisibility and modular arithmetic (Chapters in Rosen's: 1.7, 1.8, 2 and 4.1)	❓ Exit Ticket 11
	Thursday, Aug 22	Number representation cont., sets proof, divisibility and modular arithmetic [chapters in Rosen's: 1, 2.1, 2.2, 4.1 and 4.2 in Rosen's]	❓ Exit Ticket 12
4	Monday, Aug 26	Proof by contradiction, Number sets cont., WOP (Chapters in Rosen's: 1.7, 1.8 and 2)	❓ Exit Ticket 13 \| 📝 HW4
	Tuesday, Aug 27	Induction (Chapters in Rosen's: 5)	❓ Exit Ticket 14
	Wednesday, Aug 28	Induction (Chapters in Rosen's: 5)	❓ Exit Ticket 15
	Thursday, Aug 29	Cardinalities [chapter 2.5 in Rosen's]	❓ Exit Ticket 16
5	Monday, Sep 2	Labor day holiday
	Tuesday, Sep 3	Cardinalities, Relations [chapters in Rosen's: 2.5 and 9 in Rosen's]	❓ Exit Ticket 17 \| 📝 HW5
	Wednesday, Sep 4	Relations, Modular Arithmetic, Cardinalities [chapters in Rosen's: 9, 4.1 and 2.5 in Rosen’s]	❓ Exit Ticket 18
	Thursday, Sep 5	Cardinalities [chapters in Rosen's: 2.5 in Rosen’s]	❓ Exit Ticket 19