Thu, October 30th, 2014

DISCRETE MATH

HOMEWORK ASSIGNMENTS BY CHAPTER

Unit 11 - Topics from Chapters 6 & 7

Wednesday, January 5 - Hamilton Circuits, Brute Force, Nearest Neighbor - HW pg. 247 #1, 8, 10 - 12, 17, 21, 23, 24

Thursday, January 6 - Repetitive Nearest Neighbor & Cheapest Links - HW pg. 255 #31, 33, 34, 37, 39, 40, 42, 43 & Review for Quiz

Quiz on Hamilton Circuits, Brute Force & Nearest Neighbor Algorithms Friday

Friday, January 7 - Spanning Trees - HW pg. 293 #1 - 3, 5, 8, 11, 12 & Kruskal's Algorithm - HW pg. 297 #19 - 22

Monday, January 10 - Review for Test on Hamilton Circuits, Hamilton Circuit Algorithms (Brute Force, Nearest Neighbor, Repetitive Nearest Neighbor, Cheapest Links), Spanning Trees, and Kruskal's Algorithm on Tuesday

Test on Chapter 6/7  on Tuesday

Tuesday, January 11 - Test on Ch 6/7 in class today - HW Review for Exam


Wednesday, January 12 - Review for Exam

Thursday, January 13 - Review for Exam


Friday, January 14 - 2nd and 4th period final exams

* Exam review is attached as a PDF file for anyone who would like it earlier *