Instructor Info:

Eric Larson
Office: Engineering 528
Office Phone: 206-296-5513 (voice mail not checked regularly)
Office Hours: 5:00-6:15pm MW, after class as needed, or by appointment
Email: elarson@seattleu.edu (please place ‘CPSC 510’ somewhere in the subject for quicker replies)

Important Documents:

·         Syllabus

Lecture Notes:

·         Unit 1: Analysis of Algorithms (completed, PDF)

·         Unit 2: Divide and Conquer (completed, PDF)

·         Unit 3: Greedy Algorithms (completed, PDF)

o   Algorithms and proofs handout

·         Unit 4: Dynamic Programming (completed, PDF)

·         Unit 5: Linear Time Sorting

·         Unit 6: Network Flow

·         Unit 7: Parallel Algorithms

·         Unit 8: NP-Completeness

·         Unit 9: Coping with NP-Completeness

·         Unit 10: Randomized Algorithms

Assignments:

·         Homework 1 (solution)

·         Homework 2 (solution)

·         Homework 3 (due date: February 8)

·         Homework 4 (tentative due date: February 22)

·         Homework 5 (tentative due date: March 5)

·         Homework 6 (tentative due date: March 12)

Exams:

·         Midterm Exam (February 13, in class)

o   Review

o   Guide (will be distributed with the exam)

o   Practice Problems (solution)

o   PDF: Practice Problems (solution)

·         Final Exam (March 15, 6:00-7:50pm, HUNT 100)

Additional Links:

·         Linux information

·         Discrete Math Overview: Foundation of Computer Science (Aho/Ullman)

·         Power laws, Pareto distributions, and Zipf’s law (Newman)

·         Master Method (Washington University in St. Louis)

·         Wolfram Alpha

·         OpenMP

·         Parallel Programming at Intel

·         Cook-Levin Theorem (Wikipedia)

·         List of NP-Complete problems (Wikipedia)

Note: The instructor is not responsible for the content of any external website.