Discrete Structures
CSC 133    Fall 2008

How to read this schedule:

W
e
e
k

 Date Lecture Topic and Reading

Homework Problem Sets
3rd Ed

Chapter 1 The Logic of Compound Statements 
Propositional Logic Calculator
1 

 

8/21

 Logical Form / Logical Equivalence  1.1 #2, 3, 6-9, 14,16, 18
8/26 Theorem 1.1.1 1.1 #19, 26, 27, 29-34, 46
Conditional Statements 1.2 #1-11, 20, 22, 38
2 8/28 Arguments      1.3 #1-13, 24, 28, 38
9/2 Digital Logic Circuits Designing Digital Circuits  1.4 #14, 20, 32
3 9/4 Boolean Algebra and Karnaugh Maps     pp. 287 - 289  plus  handouts practice problems
9/9 Number Systems   Complements in Radix r 1.5 #2-20 even, 21, 39, 42
Chapter 2 The Logic of Quantified Statements
4 9/11 Predicates  2.1 #4-6, 8, 10, 12, 28
9/16 Quantified Statements 2.2 #2-12 even, 19-23 odd, 34, 39
Arguments with Quantified Statements 2.3 #11-20 odd
2.4 #11-19 odd, 22, 24, 26
Chapter 3 Methods of Proof
5 9/18 Direct Proof and Counterexample    3.1 #3, 12, 16, 21, 27, 45
9/23 Quotient-Remainder Theorem 3.2 #8, 21
Indirect Argument: Contradiction and Contraposition 3.3 #25, 34.  3.4 #18, 30
6 9/25 Test #1 3.8 #5, 8, 15
Chapter 4 Sequences and Mathematical Induction
6 9/30 Sequences    4.1 #6, 9, 21, 22, 27
7 10/2 Mathematical Induction 4.2 #3, 12, 20-28 even

4.3 #6, 8

Chapter 5 Set Theory
7 10/9 Basic Definitions of Set Theory   Properties of Sets 5.1 #8, 11, 12, 20, 21
8 10/14 Empty Set, Partitions, Power Sets, and Boolean Algebras      

Base Conversion Integers     PrimeFactors.java

 5.2 #14, 21. 5.3 # 27
Chapter 7 Functions         
8 10/16 Functions
 		 7.1 #3, 15; 7.2 #6,28

7.4 #1, 2

Chapter 8 Recursion, Chapter 9 O-notation and Efficiency of Algorithms
9 10/21 Recursively Defined Sequences Towers of Hanoi                               

Solving Recurrence Relations by Iteration  Recursion/Iteration/Explicit Formulae

 8.1 #2, 4   8.2 #7, 8
   
10/23 O-Notation   Cardinality with Applications to Computability  9.3 #5, 15, 21  9.5 #5, 7
Chapter 10 Relations
10 10/28 Relations on Sets Matrix Review Calc Review 10.1 #8, 18, 27
10/30 Reflexivity, Symmetry, and Transitivity Equivalence Relations 10.2 #2, 10, 13
11 11/4   Partial Order Relations CSC Poset   10.3 #2, 12, 13

Chapter 11 Graphs and Trees

11 11/16 Graphs: An Introduction Paths and Circuits 11.1 #9, 11, 17, 18, 20, 21, 23
12 11/11 Matrix Representation of Graphs Try it   Isomorphisms of Graphs   11.2 #2, 6b, 9b-c, 13, 24
11.3 #1b, 8b, 9b

11.4 #7, 9, 11

11.5#7b,15-24,33,43-51

11/13 Test #2   
13 11/18  Trees  Spanning Trees 11.6 #6, 8
     

Chapter 6 Counting Objectives

13 11/20 Counting and Probability   Possibility Trees and the Multiplication Rule 6.1 #6, 12b, 13b, 14, 23
11/20 Counting Elements of Disjoint Sets: The Addition Rule.  Counting Subsets of a Set: Combinations.
 		 6.2 #7, 12, 22, 23, 25
14 11/25 The Algebra of Combinations http://www.nist.gov/dads/ 6.3 #8b, 26
12/02 Pascal's Triangle and the Binomial Equation  

R
e
v
i
e
w
12/2

 Chapter 1 The Logic of Compound Statements
Chapter 2, 3

What if, a review of the conditional statement

The Binomial Theorem
Chapter 6 Nutshell
A Historical Perspective		  
Final Tuesday, 9 December 11:30 - 2:30 (the time for 11:00 am TR classes)