*
*

- send me email:
troby@seki.mcs.csuhayward.edu

- Homepage: http://seki.mcs.csuhayward.edu/~troby
- office: South Science 429a, phone: 510-885-2691

- office hours: Tuesday/Thursday 1:15--2:00; 8:00--8:45p.m. and by
appointment. I encourage you to come to scheduled office hours if possible.
I'm happy to answer questions by email, which I check frequently.

The breakdown of points is:

Exam 1 | Exam 2 | Quizzes | Homework | Participation | Portfolio |
---|---|---|---|---|---|

25% | 25% | 20% | 10% | 10% | 10% |

Please read the sections from the book listed before the date of the first lecture on that material.

Selected homework answers (not solutions) are available here after the homework is due. Note
that you must ** always ** show your work to receive credit.

Section: Topic |
Lect. Date |
Homework problems |
Due | |

Chapter 0: Proofs | 1/4 T | #1,2,3bdfghi,4cde,5ace,6,8,13,16,18 | 1/13 | |

§ 1.1-2: Sets | 1/6 R | 1.1: #3,4,6,10bdf; 1.2: 11,16,21,23,26 | 1/13 | |

§ 4.1: Mathematical induction | 1/11 T | #3,5bc,8c,9c,12,14 | 1/25 | |

§ 4.2: Recursive sequences | 1/11 T | #8,19,20,23,32 | 1/25 | |

§ 4.3.: Characteristic Polynomial | 1/13 R | #8,9,10,19,23bc | 1/25 | |

§ 5.1: Inclusion-Exclusion | 1/18 T | #4,7,11,14,16 | 1/27 | |

§ 5.2: Rules of Sum & Product | 1/18 T | #5,6abc,12,15,16,20,21 | 1/27 | |

NO CLASS OR OFFICE HOURS: 1/20 R | ||||
---|---|---|---|---|

§ 5.3: Pigeon-Hole Principle | 1/25 T | #5,18 | 2/3 | |

§ 6.1: Permutations | 1/25 T | # 4,5,7,9,11,15 | 2/3 | |

§ 6.2: Combinations | 1/27 R | #4,9,7,10,15,22,23b,25b | 2/3 | |

§ 6.3: Comb. w/ repetitions | 1/27 R | # 2,7,15b,17,18 | 2/3 | |

§ 6.4: Derangements | 2/1 T | #6,8 | 2/10 | |

§ 6.5: Binomial Theorem | 2/1 T | #8,10,13,21b | 2/10 | |

§ 8.1: Graphs | 2/3 R | #1,6,7,9 | 2/17 | |

§ REVIEW DAY | 2/8 T | |||

Exam 1: MOVED TO 2/10 R | ||||

§ 8.2: Graph properties | 2/15 T | #14bc,15b,17defg,22,26,30 | 2/24 | |

§ 8.3: Graph Isomorphisms | 2/15 T | #4acd,8,9 | 2/24 | |

§ 9.1: Eulerian Circuits | 2/17 R | #5,8,11,15,21 | 2/24 | |

§ 9.2: Hamiltonian Circuits | 2/22 T | #3ab,4,7,8,14,16 | 3/2 | |

§ 9.3: Adjacency Matrix | 2/22 T | #1,2,4 | 3/2 | |

§ 11.1: Trees | 2/24 R | #3,4,8,9a | 3/2 | |

§ 11.2: Tree Props | 2/24 R | #4,10,11 | 3/2 | |

§ 11.3: Spanning Trees | 2/29 T | #3,5,6 | 3/9 | |

§ 11.4: Minimum ST algorithms | 2/29 T | #1bc, 3 | 3/9 | |

§ Boolean Algs (Handout) | 3/2 R | § 9.1: #3,5,6,15,20,25; § 9.2: #2b,3b,4b,8,15 | 3/9 | |

§ REVIEW DAY | 3/7 T | |||

Exam 2: 3/9 T |

You do not need to hand in the answers to [BB] problems (or parts of problems), but you should do them to prepare for...

- A link to my home page.