| About | Announcements |
Schedule / Lecture Notes |
FAQ | Contact | Misc Readings |
|
Lecture: TTh 12:00-1:45 (confirmed for both days), JBE 152 Section1: Tuesday 6:00-7:10, JBE 372 Section2: Tuesday 7:30-8:40, JBE 372 Section3: Monday 2:00-3:10, Social Sciences 2 Room 167 Instructor: Dimitris Achlioptas Office Hours: Tuesday 2-3pm (after class) and by Appointment (via email) TA: Michael Leece Office Hours: M3:30-5 Th2-3:30 Baskin Engineering Lounge |
SyllabusA Sort of Introduction |
 |
Text: Tardos and Kleinberg The core of the course will be based on a subset of the book by Kleinberg and Tardos titled Algorithm Design (required text -- available for sale at the university bookstore). Supplements: Tantalo Lecture notes MIT OCW Introduction to Algorithm Analysis |
| Week 1 | Tue | April 2nd |
Syllabus Stable matching problem [ppt] [pdf] |
| Thur | April 4th | Some Representative Problems (+start of mergesort) [ppt] [pdf] | |
| Week 2 | Tue | April 9th | Mergesort and Inversions [ppt] [pdf] |
| Thur | April 11th |
Take-in Exam | |
| Week 3 | Tue | April 16th | Closest pair and Matrix Multiplication [pdf] |
| Thur | April 18th | Graphs [pdf] [ppt] | |
| Week 4 | Tue | April 23rd | Greedy Algorithms [pdf] [ppt] |
| Thur | April 25th | Homework 1 due [pdf] | |
| Week 5 | Tue | April 30th | Minimum Spanning Tree [pdf] [ppt] |
| Thur | May 2nd | Dynamic Programming [pdf] [ppt] | |
| Week 6 | Tue | May 7th | Homework 2 due [pdf] |
| Thur | May 9th | Midterm 12-1pm | |
| Week 7 | Tue | May 14th | Still Dynamic Programming [pdf] [ppt] |
| Thur | May 16th | Bellman-Ford [pdf] [ppt] | |
| Week 8 | Tue | May 21st | Homework 3 due [pdf] |
| Thur | May 23rd | Network Flow [pdf] [ppt] | |
| Week 9 | Tue | May 28th | Network Flow Applications and Extensions [pdf] |
| Thur | May 30th | ||
| Week 10 | Tue | June 4th | |
| Thur | June 6th | Homework 4 due [pdf] | |
| FINALS |