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 | Homework Problems | Due |

January 24 | Classes begin | 2 |
Find Phi_4 (n), Exersice 2.18 | Jan 31 |

January 31 | Properties of Sumamtions | 2 |
||

February 7 | The last day to add, and to use a permission number is Feb 6 | 2 |
2.88, 2.95 | Feb 14 |

February 14 | Recurrences | |||

February 21 | Recurrences with integers | 5 |
hw3 | Feb 28 |

February 28 | ||||

March 7 | ||||

March 14 | Generating Functions | |||

March 28 | Last day for students to drop courses via e-campus is Mar 28 | |||

April 4 | Partitions | |||

April 11 | PIE | |||

April 18 | DFA | |||

April 25 | Waiting Time Problems | |||

May 2 | Classes end May 2 | Review | ||

May 5 | Final exam | at 3pm |