CMPS 102

 Introduction to Analysis of Algorithms

Winter 2002


Don't Forget:

Review Sessions by Randolph Goldman:
            Monday March 18
            12:00-2:00 pm, 4:00-6:00 pm, 8:00-10:00 pm
            All at Baskin White Board Area

Final Exam:
            Tuesday March 19,  12:00-3:00 pm, Kresge 327


Description:  Methods for the systematic construction and mathematical analysis of algorithms. Order notation, the RAM model of computation, lower bounds, and recurrence relations are covered. The algorithm design techniques include divide-and-conquer, branch and bound, and dynamic programming. Applications to combinatorial, graph, string, and geometric algorithms.
Prerequisite:  CMPS 101

Time and Place: TTh   12:00 – 1:45    Kresge 327
Class Webpage: http://www.soe.ucsc.edu/classes/cmps102/Winter02/
Class News Group: ucsc.class.cmp102

Instructor:   Patrick Tantalo  (http://www.soe.ucsc.edu/~ptantalo/)
Email:   ptantalo@soe.ucsc.edu
Office:   Baskin Engineering  343A
Office Hours:   MWF   11:00-1:00, and by appointment.
Phone:   831-459-3898
 

Teaching Assistant: Randolph Goldman (randolph@soe.ucsc.edu)
Discussion Sections:
Monday         4:00-5:30     Baskin Engineering White Board Area
Thursday        7:00-8:30     Baskin Engineering White Board Area
 

Important Links:

Syllabus:  PDF, MSWord

Homework

Handouts



If you find any errors, please report them to: ptantalo@soe.ucsc.edu

webmaster@soe.ucsc.edu

Back to the SOE Class Home Pages
Back to the SOE Home Page