CS 240 - Intro to Discrete Mathematics Spring 2011

Scribes

Note: The lecture titles reflect the major topic of the lecture in the context of the course. The actual coverage of that topic may start the lecture before and end the lecture after.

	Date	Topic
1	1/18	Introduction
2	1/20	Propositions
3	1/25	Predicates
4	2/1	Sets
5	2/3	Proofs
6	2/8	Induction
7	2/10	Strong Induction
8	2/15	Structural Induction
9	2/17	Invariants
10	2/22	Program Correctness
11	2/24	Recursion
12	3/1	Recurrences
13	3/3	Program Analysis
14	3/8	Asymptotic Analysis
15	3/10	Review
16	3/29	Relations and Functions
17	3/31	Equivalence and Order Relations
18	4/5	Digraphs
19	4/7	Graphs
20	4/12	Trees
21	4/14	Finite State Machines
22	4/19	Regular Expressions
23	4/21	Nondeterministic Finite Automata
24	4/26	Finite Automata vs Regular Expressions
25	4/28	Counting
26	5/3	Permutations and Combinations
27	5/5	Combinatorial Arguments

Additional Handouts

• Divisbility and Primes

• Selection Sort