Homework assignments are to be submitted via Moodle before class on the day on which they are listed. Projects are due by 11 PM via Moodle on the day on which they are listed. Note that all page numbers and problems listed are specific to the hardcopy version of the book with the ISBN number as listed in the syllabus.

Date | Class Period & Lecture Topic | Reading | Assignment |
---|---|---|---|

Jan 11 | Syllabus, policies, business, goals, intro | ||

Jan 13 | Big-O and basic arithmetic | pp. 1-15 | Install Python and PyQt5 and start playing around |

Jan 18 | Modular arithmetic and Primality | pp. 16-30 | HW1 |

Jan 20 | Cryptography and Euclid | pp. 30-38 Cracking RSA (optional) |
HW2 P1 Design Experience |

Jan 25 | DIVIDE AND CONQUER:Multiplication, Recurrence Relations, Merge Sort |
pp. 45-50 | HW3 P1: Primality Tester |

Jan 27 | Medians, Matrix Multiplication, Convex Hull | pp. 50-57 | HW4 |

Feb 1 | GRAPHS:Depth-first Search |
pp. 80-87 | HW5 P2 Design Experience |

Feb 3 | Directed Graphs and Strong Connectedness | pp. 87-95 | HW6 |

Feb 8 | Shortest Paths | pp. 104-113 | HW7 |

Feb 10 | Priority Queues and Variations on Shortest Path | pp. 113-120 | HW8 P2: Convex Hull |

Feb 15 | GREEDY:Minimum Spanning Trees |
pp. 127-138 | HW9 |

Feb 17 | Huffman Encoding | pp. 138-143 | HW10 P3 Design Experience |

Feb 22 | Horn Formulas and Set Cover | pp. 144-147 | HW11 |

Feb 24 | Midterm | Study Guide | |

Mar 1 | DYNAMIC PROGRAMMING:Longest Increasing Subsequence and Edit Distance |
pp. 156-164 | HW12 P3: Network Routing |

Mar 3 | Knapsack and Chain Matrix Multiplication | pp. 164-171 | HW13 |

Mar 8 | Shortest Paths and Independent Sets | pp. 171-177 | P4 Design Experience |

Mar 10 | Dynamic Programming Continued | HW14 | |

Mar 15 | LINEAR PROGRAMMING:Introduction to Linear Programming |
pp. 188-198 | HW15 |

Mar 17 | Duality and Zero-sum Games | pp. 206-213 | HW16 P4: Gene Sequencing |

Mar 22 | Spring Break |
||

Mar 24 | Spring Break |
||

Mar 29 | INTELLIGENT SEARCH:Backtracking and Branch & Bound |
pp. 271-276 + extra B&B TSP material |
HW17 |

Mar 31 | More Branch & Bound | pp. 271-276 + extra B&B TSP material |
P5 Design Experience (due Fri) |

Apr 5 | More Branch & Bound | pp. 271-276 + extra B&B TSP material |
HW19 |

Apr 7 | NP-completeness | pp. 232-247 + "Unsolvable Problems" (p. 263) |
HW20 |

Apr 12 | Approximation and Local Search | pp. 276-293 | |

Apr 14 | ADVANCED ALGORITHMS:Randomized Algorithms & Grad School |
Section 2.4; Boxes on pp. 29, 56, 140 |
P5: TSP with Branch and Bound |

Apr 19 | Evolutionary Computation | HW21 | |

Apr 21 | Neural Networks | ||

Apr 26 | Final Exam Review | Study Guide | |

Apr 28 | Group Project Presentations | P6: Group TSP | |

May 5 | Final (10:00 AM - 12:00 PM) |
Study Guide |

The schedule is subject to change. The final is Thursday, May 5th from 10 AM - 12 PM on Moodle using Examity.