ECS 122B - Winter 2007 Advanced Algorithm Design and Analysis
New Announcements
- REVISED 3/8: For problem one, gcc -O4 optimization was used for the suggested 1 minute run time; also this was program time, not elapsed time (which will depend on how busy your system is)
- Takehome Final Due 3/16
- Note instructions. Also, no more OH after Thursday, 3/8, so look at
it early
-
- Problem Set 4 solutions (3/5)
- Extra office hours: W 3/7: 1:30-2:30, Th 3/8 12-2
-
- End of quarter stuff: takehome Final out Monday March 5 (Due at regular final time: Friday March 16, 6PM (but extensions possible)
- Makeup Class Wed. 3/7 3:10-4 in 1 Wellman;
- No class Monday March 12
- Midterm II Wed., March. 14. Open book/notes.
-
- Information on branch/bound and local search can be found on Wikipedia (not great for this but OK_
- Problem Set 3 solutions (2/20)
- Problem Set 4 (2/15)
- Code used with Problem Sets 2,4 (1/19) Due 1/31
-
- Note: much the material covered in today and the next two lectures is not in either text.
-
- Problem Set 3 (2/9)
-
- Notes on Short A-Path algorith/analysis (1/19)
-
Old Announcements
- Old Announcements
-
- General Information (1/1)
-
- Some useful algorithms books listed below.
- Link for NTL a libraray for Number theory added below (has modular exp. for large numbers, and primality testing).
-
- Link for the gcov profiler added under web pages, handout below on profiling/timing in supplemental readings (will be finalized Monday aft).
Class Information
Homeworks and Homework Solutions (To Ps2 is live)
Web, Pages
Midterm and Final
Syllabus, Readings, and General Information
Some useful algorithms books
- Network Flows, by Ahuja, Magnanti, Orlin
- Approximation Algorithms for NP-hard problems, by Hochbaum
- Algorithms on Strings, Trees and Sequences, by Gusfield
Programs
Supplemental Readings