Syllabus

Discrete Mathematical Structures, Fall 2010 MTH447

The following calendar gives a timetable for the course. Your class may be slightly behind or ahead at any given time.Below the calendar is a list of sections in the textbook "Methods in Algorithmic Analysis, 2010 Chapman and Hall/CRC Press, by Vladimir A. Dobrushkin.

Some of these may be done in class, others as homework. You should
attempt them all. (Note: In the problem lists, a notation like 3-9
means that all the problems 3,4,5,6,7,8,9 are assigned.)

Week | Events | Chapter | Problems |

September 8 | Classes begin | 1 |
1.9 and 1.40 |

September 13 | Properties of Sumamtions | 2 |
2.12(a,b)2.19,2.44(a,b) |

September 20 | The last day to add, and to use a permission number is September 21 | 2 |
2.107, 2.112, 2.115, 2.118 |

September 27 | Recurrences | 2.66 | |

October 4 | Recurrences with integers | 5 |
5.20, 5.23 |

October 11 | No class on October 11 | ||

October 18 | |||

October 25 | Generating Functions | ||

November 1 | Last day for students to drop courses via e-campus is Nov 3 | ||

November 8 | Partitions | ||

November 15 | PIE | ||

November 22 | Thanksgiving Recess Nov 25-28 | ||

November 29 | Asymptotics | ||

December 6 | Classes end December 9 | Review | |

December 20 | Final exam | at 11:30am |