CPSCI 330: Algorithms

What’s New!

May 4, 2007.

I'll be holding a special set of office hours during the Reading Period before final exams: 10:00 a.m.–2:00 p.m. on Monday, May 7.

Miss an announcement? Take a look at What’s Old! (the “What’s New!” archive).

Course Materials

• Syllabus
  • requirements
  • academic conduct
• Course and Reading Schedule
• Final Project Assignment
• Handouts
  • Theorems for Efficiency Analysis
  • Two “Negative” Theorems
• Readings on Algorithms (password protected)
  • Turing Award Lectures
  • from Computing Surveys
• Student Websites

Homework Assignments

• Homework 0 (due 1/18)
• Homework 1 (due 2/1)
• Homework 1.5 (due 2/6)
• Homework 2 (due 2/16)
• Homework 3 (due 2/20)
• Homework 4 (due 3/1)
• Homework 5 (due 3/6)
• Homework 6 (due 4/17)
• Homework 7 (due 5/1; assignment on handout)
• “Floating” Homework (due 5/3)

Resources

• SI prefixes: normal and binary
• Tower of Hanoi algorithms and information
• Josephus problem animation and information
• Pancake flipping problem animation and information
• Moore's explanation of the Boyer-Moore string matching algorithm
• Stephen Cook on complexity theory

[ Return to Brian Rosmaita’s Homepage ]