**Week1:MLK day, Jan 21
**

**Chapter 1 and 2 Algorithms and their Analysis (complexity)****PPTs lecture1****MIT Video:**Peek Finding**Software**: Anaconda Python, Visual C++ 2013. Python Book

**Week2:Jan 26-28: **

**Chapter 3:Growth of Functions.**

**Please send me an email ASAP so I can add you to my email list**!!!!!

**PPT lecture 2**

**Hw 1****: 3-3 Due: Feb 2****MIT Video:**Models of Computation**Project#1: (Due Friday Feb 6) Empirical Studies of Two Sorting Algorithms.**

Week3:Feb 2-4

- More Algorithm Complexity (ppts Lecture 3 and 4)
- Recurrence Relations and Merge Sort (see ppt) (See video)

**Week4:Feb 9-11
**

**Exam on Monday!**- Start introduction to Dynamic Programming

**Week5: Feb 16-18**

**Continue DP.****Homework DP (class handout)**

**Week6: Feb 23-25:**

**Longest Common Sub-sequence(see video)**

**Matrix Chain Multiplication****Optimal Binary Search Trees**

**Project#2: A Dynamic Programming Example(class handout)****Solution of last problem on Exam due next Monday.**

**Week7:Mar 2-4**

- Exam 2 Wed

**Week8: Mar 9-11
**

**Week9: Oct 20-22**

- More hashing,Coalesced Hashing
**Exam Wed**

**Weel10:Oct 27-29: (Oct 27 is last day to drop)**

- Project4: Coalesced Hashing (due Nov 12)
**Red Black Trees (Demo)**

**Dynamic programming. Watch MIT video****on Dynamic Programming**

**Week11:Nov 3-5
**

**Week12:Nov 10-12**

- Longest Common Sub-sequence
- Other examples

**Week13:Nov 17-19**

- More examples to discuss. Knapsack, Intro to Greedy ALgorithms
**Exam Wed (Red Black Trees, Dynamic programming and Coalesced Hashing)**

**Week14:Nov 24-Thanksgiving
**

**Week15:Dec **1-3

**Final Exam Monday Dec 8th @5:45-7:45
**

**Week 17:**