ECS 122A - Winter 2006 Algorithm Design and Analysis
Spring 2008 Announcement
Link to Spring 2008 Web page
New Announcements
Final Grades by last 4 digits of ID (Final median=61)
final grades
(3/24)
Scores for ps1-6 and midterm. last 4 digits of ID # order
Scores
htm (3/20) does not reflect today's updates
Problem Set 6 Solutions
PDF (3/14)
Hard Problems and solutions
- A listing of NP-hard problems and approximation results
Handout F
- Notes on suffix trees:pdf
More details in Algorithms on strings, trees, and sequences: computer science and computational biology By D Gusfield - 1997
Handout E
- Notes on FSM and KMP:pdf
Old Announcements
Handout B - - Lempel Ziv (not exactly as I will use)
LZ writeup
2nd writeup
a varient: LZW
Handout C
- gzip information doc
Handout D
- - Gzip Notes: huffman codes and Lempel-Ziv
Handout D1
- Cook/Martel - Gzip Notes
The text is Introduction to Algorithms, second edition by Cormen, Leiserson, Rivest, and Stein
You may be able to find it online for better price.
Also, www.bestwebbuys.com is a source for the best price on a book
Text Notes: Be sure to get 2nd Edition. Also, the book is a good reference so may be worth getting in hardcover (but heavier)
Old Announcements
If you have questions about HW grading, Reader OH: Kemper.
Reader is Valerie Szudziejka email: szudziej AT cs DOT ucdavis.edu
put in HW box in 2131 Kemper.
For email submissions, PDF is preferred (if you want to use something else, please email the reader to check)
General Information
Course information sheet
- You are responsible for everything on this
ECS 122A Class meets in 158 Olson MWF 10:00-10:50. This web page will contain information for the class.
Discussion sections:
F 3:10-4:00A WELLMAN 212
discussions will begin January 6
TA, Instructor Info
Charles Martel
. Kemper Hall , #3049.
martelATcsDOTucdavis.edu
. Office hours:
T: 10-11:30 Th: 12:45-2:00
.
Teaching Assistants
Balaji Venkatachalam
.
3104 Kemper
bala AT ucdavis DOT edu
.
Office hours:
M,W: 3:10-4:30, F:4-5
.
Reader Info
Valerie Szudziejka, email: szudziej AT cs DOT ucdavis.edu Engineering II, #31. Office hours:
TBA
.
Syllabus, Readings, and General Information
Course information sheet
- You are responsible for everything on this
Planned Syllabus for this Course
-->
lectures
- Topics of completed and future lectures
lectures
- S04 lectures
Homeworks and Homework Solutions
NOTE: Links for later problem sets not yet live.
Problem Set 0 PDF
(1/4)
Problem Set 0 solutions
text
Problem Set 1
PDF (1/6)(Due : 1/17)
Problem Set 1 solutions
PDF (1/18)
Note: solution to 4 a) is a bit incomplete.
Problem Set 2
PDF (1/17)(Due : 1/26)
PS 2 sol
PDF ( 1/27)
Problem Set 3
PDF (2/27)(Due : 2/7)
Problem Set 3 Solutions
PDF (2/7)
Problem Set 4
PDF (5/4)
Problem Set 4 Solutions
PDF (2/22)
Problem Set 5
PDF (2/13)
PS 5 Solutions
PDF (3/2)
Problem set 6 Out, Due Monday 3/13, 3:15 PM
Problem Set 6
PDF (3/2)
PS 6 Solutions
PDF (6/5)
Midterm and Final
Midterm Solutions
Solutions
PDF (2/10)
Mid solutions pdf
(5/15)
Sample Midterm pdf
(1/31)(Solutions: 5/3)
Mid solutions pdf
(2/7)(: 5/3)
Mid section 1 pdf
5/13)
Mid section 2 pdf
5/13)
Midterm solutions both, text
(5/13)
NOTE: for the sample final ignore problems about Boyer-Moore string matching. Instead, build a finite state machine for the pattern given.
Sample Final and Solutions pdf
(5/29)
2nd Sample Final NO Solutions pdf
(5/29)
Programs
coins regular C
- program for min coins
coins memeoization C
- better program for min coins
Supplemental Readings
Handout A - - Stable marriage
formal definitions
problem definition and solution (first 5 pages only)
a folksier writeup
more background on the problem
Handout B - - Lempel Ziv (not exactly as I will use)
LZ writeup
2nd writeup
a varient: LZW
Handout C
- gzip information doc
Handout D
- - Gzip Notes: huffman codes and Lempel-Ziv
Handout D1
- Cook/Martel - Gzip Notes
Handout D
- - Notes on FSM and KMP: PDF
Handout E
- Notes on FSM and KMP:postscript
Suffix Tree notes, from Algorithms on Strings, Trees and Sequences
By Dan Gusfield
Handout F
- Notes on suffix trees:pdf
Handout G
- Martel - Notes for approximate string matching from Martel's class
Other Information
Hard Problems and solutions
- A listing of NP-hard problems and approximation results
Ghostscript/Ghostview/GSview
- If you need software to preview/print PostScript