W
e
e
k

Date

Lecture Topic and Reading

Suggested Problems

Chapter 1 The Logic of Compound Statements

1 

1/18

Logical Form / Logical Equivalence 

1.1 #2, 3, 6-9, 13-15

1/13

Theorem 1.1.1

1.1 #17-20, 23, 26, 27, 29, 30, 37, 38, 42

Conditional Statements

1.2 #1-11, 16, 25, 29- 30(a) only, 36

2

1/15

Arguments     

1.3 #1-10, 21-31, 35

1/20

Digital Logic Circuits Designing Digital Circuits 

1.4 #1-15 odd, 18, 20, 26-32

3

1/22

Boolean Algebra and Karnaugh Maps

practice problems

1/27

Number Systems   Complements in Radix r

1.5 #1-18, 20-33, 35-43

Chapter 2 The Logic of Quantified Statements

4

1/29

Predicates 

2.1 #3, 5, 8, 9-13, 28-36

2/3

Quantified Statements

2.2 #2-12, 18, 20, 22-29

Arguments with Quantified Statements

2.3 #7-16, 19, 21-24

Chapter 3 Methods of Proof

5

2/5

Direct Proof and Counterexample   

3.1 #3, 8, 11, 12, 17, 18, 21-27

2/10

Quotient-Remainder Theorem

3.4 #2-11, 15-17, 20-22

Indirect Argument: Contradiction and Contraposition

3.6 #1, 2, 4, 5, 6, 10, 12

6

2/12

Test #1

Chapter 4 Sequences and Mathematical Induction

6

2/17

Sequences  

4.1 #1-15 odd,
19-47 odd

7

2/19

Mathematical Induction

4.1 #49-55, 59, 61
4.2 #1, 3, 5, 6, 8, 9, 14, 19 - 25

Chapter 5 Set Theory

7

2/24

Basic Definitions of Set Theory   Properties of Sets

5.1 #1-14. 5.2 #1-4, 7, 10, 11, 28, 30, 35

8

2/26

Empty Set, Partitions, Power Sets, and Boolean Algebras  

5.3 #21-28, 35

8

3/02

Base Conversion Integers   Things to Know
Recursively Defined Sequences Towers of Hanoi

8.1 #1, 3, 6, 10, 11

Chapter 8 Recursion, Chapter 9 O-notation and Efficiency of Algorithms

9

3/04

Solving Recurrence Relations by Iteration  Recursion/Iteration/Explicit Formulae

8.2 #1, 2, 3, 5, 10, 38, 41, 42, 44

 Functions, 1-1, onto, inverse, logs, exponential, composition   Ch. 7

7.1, 7.3, 7.4, 7.5, 7.6

3/16

O-Notation   Cardinality with Applications to Computability 

9.3 #1-3, 29-36. 
7.6 # 1,2,3,7,14a

Chapter 10 Relations

10

3/18

Relations on Sets Matrix Review

10.1 #1-3, 8-10, 12, 17, 23-25, 27

3/23

Reflexivity, Symmetry, and Transitivity Equivalence Relations

10.2 #1-8, 12, 13, 23, 26, 27
10.3 #2, 4, 6, 7, 14. 

11

3/25

  Partial Order Relations CSC Poset  

10.5 #1, 3, 6, 8, 10, 11

Chapter 11 Graphs and Trees

11

3/30

Graphs: An Introduction Paths and Circuits

11.1 #2, 4, 15-24, 28, 36, 37
11.2 #1, 2, 6, 8, 12-24 even

12

4/1

Matrix Representation of Graphs    Isomorphisms of Graphs  

11.3 #2-10, 19. 11.4 #1-7

4/6

 Review

13

4/13

Test #2

11.5 #2, 3, 4a,c,d,e, 8, 9, 10, 18, 19, 33-42

4/15

 Trees  Spanning Trees

11.6 #5-8, 11

Chapter 6 Counting Objectives

14

4/20

Counting and Probability   Possibility Trees and the Multiplication Rule

6.1 #2-4, 7, 8, 9, 10, 23. 6.2 #5-9, 11, 12, 16, 19, 20, 21

4/22

Counting Elements of Disjoint Sets: The Addition Rule.  Counting Subsets of a Set: Combinations.

6.3 #3, 13, 17, 24
6.4 #1, 6, 7, 12, 13, 16

The Algebra of Combinations 
Pascal's Triangle and the Binomial Equation

6.6 #1, 3, 5-8, 13, 14
6.7 #1, 4, 6, 7, 8

R
e
v
i
e
w

Final

  Bear 206  Friday April 30