Schedule

Number Representation	3 lectures, May 5-8
Welcome	Prereq, admin		REC1 due 5/06
Bases of numeration Binary Base Conversions	HFJA ch 1 Optional : Geometric Progression		HW1 due 5/12
Two’s Complement Octal, Hexadecimal	Overflow Optional : Multiplication with 2’s Complement
Product Rule	Optional : Binary Search Optional: Bitwise Operations in C++
Modulo Arithmetic	HFJA ch 6.1-6.4

Logic and Sets	5 lectures, May 8-19
Boolean Variables, Truth Tables	HFJA ch 3		REC2 due 5/08
Operators, Boolean Algebra Negation	Circuits and algebra HFJA ch 2		HW2 due Fri 5/16
Logic Statements, Predicates	HFJA ch 3
Implications, Quantifiers
Sets, Notation, Operations	HFJA ch 8		REC3 due 5/13
Sum Rule, PIE			REC4 due 5/15
Sets counting, Pigeonhole Principle			HW3 due Mon 5/19

Induction, Sequences, Recurrences	5 lectures, May 19-27
Induction 1: Concept, Examples	HFJA ch 13		HW4 due Fri 5/23
Sequences and Series	HFJA ch 12		REC5 due 5/20
Induction 2: Proofs, Fibonacci			REC6 due 5/22
Induction 3: More proofs Structural Induction			HW5 due Mon 5/26
Recurrences by Induction	HFJA ch 14,15		REC7 due 5/27
Mon 5/26 Memorial Day : NO CLASS / OH

Midterm, in class, 3 hours

Fri 5/30, SH 215 11AM-2PM

Allowed: cheatsheet 4 pages (2 sheets) of notes; must by written by you Allowed first 45 min: notes/HWs/textbook ; must be on paper Allowed: calculators (not phones, tablets)

Practice ExamA Practice ExamB

Counting	4 lectures May 27- June 3
Permutations and Combinations	HFJA ch 9.4-9.8		REC8 due 5/29
Counting, balls into bins	Optional : Much Harder Counting Problems		HW6 due Mon 6/2
Counting, Binomial Theorem	Optional: More counting, Binomial Coef		REC9: due 6/3
More Counting Problems Recap: Sets and Counting	Optional: Catalan ; Catalan_proof		HW7 due Fri 6/6

Probabilities	4 lectures June 3-10
Probab, RV, Conditionals	HFJA ch 10		REC10 due 6/5
Expectation, variance			HW8 due Mon 6/9
Markov Chains			REC11 due 6/10
Entropy, Codes Recap: Probabilities			HW9 due Fri 6/13

Graphs	3-4 lectures June 11-16
Graphs Intro	HFJA ch 17		REC12 due 6/12
Trees, BST			HW10 due Fri 6/20
BFS, DFS, DAGS Dijkstra Alg for SSSP	optional: Strongly connected Components optional: Minimum Spanning Trees		REC13 due 6/172

Sorting Algorithms	1-2 lectures June 17-18
MergeSort recurrence	HFJA ch 11.1.4; ch 11.2-11.3		REC14 optional, no credit
Sorting Methods	HFJA ch 14, ch 15 Optional: HeapSort, QuickSort
Algorithms and Recurrences
Thu 6/19: Juneteenh, NO CLASS. Optional Recitation/OH

Final Exam, in class, 3 hours

Mon 6/23, SH 210 2PM-5PM

Allowed: cheatsheet 4 pages (2 sheets) of notes; must by written by you Allowed first 45 min: notes/HWs/textbook ; must be on paper Allowed: calculators (not phones, tablets)

Practice ExamA Practice ExamB Practice ExamC Practice ExamD