Course Description and Learning Objectives

This course teaches some "non-calculus" math concepts that are used in computer science. In particular, it covers basic logic, mathematical proof techniques, and a selection of discrete mathematics topics such as combinatorics (counting), discrete probability, and graph theory. The learning objectives of the course are the following

Learn how to read and write precise statements using mathematical notation.
Learn certain methods to prove mathematical statements, and learning to apply them.
Learn certain basic mathematical concepts arising in counting, probability, and graph theory, and also learn how to apply them.
Learn how the aforementioned goals are relevant to computer science.

What you know after taking COSC 30

Logistics

Prerequisites: CS10; Read: "what should I be knowing before CS 30?"
Class timing: 9L hour (M-W-F, 8:50 - 9:55, X-hour on Th, 9:05-9:55)
Class venue: Cummings 200
Problem Solving Sessions: Friday 4-5:30@Cummings 105, Sunday 3-4:30 @ECSC008.
Online Discussions: Ed Discussion
Work Submissions: (mostly) Gradescope
Personnel & Office hours: Instruction Team & Office Hours
Policies: Policies
Textbook: No particular textbook needed. Lecture notes and plenty of practice problems (with solutions) will be posted. However, I like this book by David Liben-Nowell, and you might too.
Read these: Best Practices ; Honor Principle & CS 30

Evaluation

Problem Sets: 45%
Exams: 55% (two midterms + one cumulative final: 15% + 15% + 25%)
Details: Deliverables and Evaluation

Tentative Weekly Schedule
Date	Lecture Material	Associated Exercises/Problems	Other info
16 Sep (M)	Introduction		W1 problems released with some solutions
18 Sep (W)	Logic I: Propositional Logic	W1: P1-7	W0 Tex File
19 Sep (X)	(catch up: definition of tautology, etc + some problem solving from W1)
20 Sep (F)	Logic II: Predicate Logic	W1: P8 - 12
23 Sep (M)	Proofs I: Direct Proofs	W2: P1 - P8	W2 problems released with some hints and solutions
25 Sep (W)	Proofs II: Contradiction	W2: P9 - P11	Some notes on the Halting Problem can be found here.
26 Sep (X)
27 Sep (F)	Proofs III: Pigeon Hole Principle	W2: P12 - P14
30 Sep (M)	Induction I: Basic Principle	W3: P1	W3 problems released with some hints and solutions
2 Oct (W)	Induction II: Strong Induction	W3: P2-P14, P18-20
3 Oct (X)	(more induction: we did W3, P3 and P11; see solutions for "notes")
4 Oct (F)	Inductions III: Proving Recursive Programs Correct	W3: P15-17
7 Oct (M)	Comb I: Basic Principles	W4-5:P1-5	W4-5 problems released with some hints and solutions
9 Oct (W)	Comb II: Bijections & Division Rule	W4-5: P6-14
10 Oct (X)
11 Oct (F)	Comb III: Binomial Coefficients
13 Oct (Sun, 3p-4p)	Midterm 1 Review Session
14 Oct (M)	Comb IV: Four-Fold Formula	W4/5: P15-18
16 Oct (W)	Comb V: Binomial Expansion and Comb. Identities	W4/5: P19-28
17 Oct (X)			Midterm 1 6:30p - 9pm Cummings 100
18 Oct (F)	Prob I: Basics		W6-7 Problems released with some hints and solutions
21 Oct (M)	Prob II: Cond. Prob, Independence
23 Oct (W)	Prob III: Cond Prob, Bayes Rule	W6/7: P1-7	Supplement: Conditional Independence & "Naive Bayes"
24 Oct (X)	we will use X-hours (quite a bit of overflow)
25 Oct (F)	Probability IV: Random Variables
28 Oct (M)	Probability V: Expectation I
30 Oct (W)	Probability VI: Expectation II	W6/7: P8-24
31 Oct (X)
1 Nov (F)	Probability VII: Deviation from Expectation, Variance
3 Nov (Sun, 3:30p - 4:30p)	Midterm 2 Review Session
4 Nov (M)	Graphs I: Degrees, Handshaking		W8/9 problems released with some solutions
6 Nov (W)	Graphs II: Connectivity
7 Nov (X)			Midterm 2 6:30 - 9pm LSC 200
8 Nov (F)	Graphs III: Cycles & Trees
11 Nov (M)	Graphs IV: Bipartite Graphs
13 Nov (W)	Graphs V: Matchings & Hall's Theorem
14 Nov (X)	Graphs VI: Proof of Hall's Theorem
15 Nov (F)	no class		DeepC out of town
18 Nov (M)	Course Review + AMA Session		11-18-2024.pptx finals-w23-sols.pdf
24 Nov (Sun)			Finals 11:30a - 2:30p LSC 200

Accessibility Needs

Students requesting disability-related accommodations and services for this course are required to register with Student Accessibility Services (SAS; Apply for Services webpage; student.accessibility.services@dartmouth.edu; 1-603-646-9900) and to request that an accommodation email be sent to me in advance of the need for an accommodation. Then, students should schedule a follow-up meeting with me to determine relevant details such as what role SAS or its Testing Center may play in accommodation implementation. This process works best for everyone when completed as early in the quarter as possible. If students have questions about whether they are eligible for accommodations or have concerns about the implementation of their accommodations, they should contact the SAS office. All inquiries and discussions will remain confidential.

Religious Observances

Some students may wish to take part in religious observances that occur during this academic term. If you have a religious observance that conflicts with your participation in the course, please meet with me before the end of the second week of the term to discuss appropriate accommodations.