# Lectures for EE 607 Spring 2004

Under construction
Last updated:  April 2, 2004

• Syllabus
• Lectures:  MWF 1:30-2:20, Holmes 389
• InstructorGalen Sasaki
• Email: sasaki@spectra.eng.hawaii.edu
• Office:  Holmes 436.  Office Hours:  MWF 2:30-3:20
• Tel: 956 6103
Announcements:
• Midterm Exam:  April 12 (monday).  Covers the lecture material up to Max Flow Algorithms, i.e., it will not include NP Completeness.  It will cover Homeworks 1 through 6.  The exam will be 50 minutes.  You are allowed the Corman, Leiserson, Rivest, and Stein textbook and 1 page of notes.
• Lectures
• Projects
• Homeworks
• Homework 1, Due Jan 21 (wed)
• Homework 2, Due Jan 28 (wed):  This is out of the second edition of Cormen et al.  Many of these are pretty easy.
• Problem 1.2-2 (page 13; 1 pt)
• Problems 2.1-1, 2.1-4 (pages 20 and 21; 1 pt each)
• Problems 2.2-1 and 2.2-2 (page 27; 1 pt each)
• Problems 2.3-2 and 2.3-3 (page 36, 1 pt each)
• Problems 2-1 and 2-2 (pages 37 and 38, 4 pts each)
• Homework 4, Due Feb 18 (wed):  This is out of the second edition of Cormen et al.
• Problem 24.1-3 (page 591, 1 pt)
• Problem 24.3-2 (page 600, 2 pts)
• Problem 24.3-3 (page 600, 2 pts)
• Problem 24.3-4 (page 600, 2 pts).  Note that a path <v0, v1, ...., vn> has reliability r(v0,v1) x r(v1,v2) x ... x r(vn-1,vn).
• Problem 24-1 (a) (page 614, 2 pts.)  Don't do part (b)
• Problem 24-3 (a) (page 615, 2 pts.)  Don't do part (b)
• Homework 5, Due March 8 (Mon):  This is out of the second edition of Cormen et al
• Problem  26.1-7 (p. 650, 1 pt)
• Problem 26.2-6 (p. 663, 1 pt)
• Problem 26.3-3 (p. 668, 1 pt)
• Problem 26.3-4 (p. 669, 2 bonus points -- not so easy)
• Problem 26-1 (p. 692, 2 pts)
• Problem 26-3 (p. 693, 3 pts)
• Problem 26-4 (p. 694, 2 pts)