CS103a Course Syllabus

DateTopicDue
9/27Introduction 
9/29Background & History 
10/2Introduction to Prop LogicRead BE pp. 1-10, 19-31, 41-46
10/4Methods of ProofRead BE pp.46-65
10/6ConnectivenessRead BE pp.67-86, 93-100
10/9Logical ConsequencesRead BE pp.106-125
10/11Boolean Algebra 
10/13Simple Circuits 
10/16Methods of Proof IIRead BE pp.127-141
 Exam 1: distributed noon 10/16, due noon 10/17  
10/18Proof StrategiesRead BE pp. 167-173
10/20ConditionalsRead BE pp. 176-190
10/23
Quantifications I
Read BE pp. 227-251
10/25Logic of QuantifiersRead BE pp. 257-283
10/27Multiple QuantifiersRead BE pp. 289-307
10/30Proofs with Quantifiers I Read BE pp. 319-338
11/1Proofs with Quantifiers IIRead BE pp. 342-36
 Exam 2: distributed 11/2, due noon 11/3 
11/3no class 
11/6Resolution 
11/8Proving Real TheoremsRead Rosen pp.167-181
11/10Proving RealTheorems II 
11/13Sequences and SummationsRead Rosen pp. 69-76
11/15Induction I Read Rosen pp. 186-199
11/17Induction II  
11/20Program Proofs 
 Exam3: deistributed 11/20 due 11/21 
11/22Recursive Definitions Read Rosan pp. 202-209
11/27Recursive Algorithms Read Rosen pp.214-218
11/29Combinatorics I  
12/1Combinatorics II 
12/4FunctionsRead Rosen pp. 56-67
12/6Review 
Final: Fri., Dec. 15, 8:30 -11:30 am



Information
Contacting Us
Handouts