CMPS 201
Analysis of Algorithms
Fall 2018


 
Final Exam: Tuesday December 11, 8:00-10:00am

Syllabus  
Canvas    
Piazza (Signup Link)
Homework Assignments             
Handouts  
  
Notes  
Webcasts      

Midterm 1 Review Problems   Solutions to Selected Problems  
Midterm 1 Solutions  

Midterm 2 Review Problems   Solutions to Selected Problems  
Midterm 2 Solutions  

Final Exam Review Problems  Solutions to Selected Problems  



Time and Place:  TTh   11:40am - 1:15pm   Merrill 102     
Class Webpage:  https://classes.soe.ucsc.edu/cmps201/Fall18/


Instructor: Patrick Tantalo (http://www.cse.ucsc.edu/~ptantalo/) 
Office: E2 255 
Office Hours:   Wednesday 9:30am-1:30pm, or by appointment 
Email: ptantalo@soe.ucsc.edu 

Teaching Assistants: 
Ryan Compton  (rcompton@ucsc.edu)
Saeed Kargar  (skargar@ucsc.edu)

TA Office Hours:  
Monday     10:00am-11:00am    Baskin 121        Saeed
Friday     11:00am-12:00pm    Baskin 121        Ryan 


TA Discussion Sections:
 
Monday      2:00pm- 4:00pm    Baskin 312 C/D    Ryan
Tuesday     2:00pm- 4:00pm    Baskin 312 C/D    Ryan
Thursday    8:00am-10:00am    Baskin 312 C/D    Saeed
Friday     11:00am- 1:00pm    Baskin 312 C/D    Saeed



Required Text:
Introduction to Algorithms (3rd edition) by Cormen, Leiserson, Rivest and Stein (CLRS). MIT Press 2009
(ISBN 9780262033848).

Recommended Texts:
Fundamentals of Algorithmics, Brassard and Bratley, Prentice Hall (1996).
Algorithmics: Theory and Practice, Brassard and Bratley, Prentice Hall (1988).
Computer Algorithms, Baase and van Gelder, 3rd ed, Addison-Wesley (2000).
Computer Algorithms: Introduction to Design and Analysis, Sara Baase, 2nd ed, Addison-Wesley (1988).
Algorithm Design Manual, Steven S. Skiena, Telos/Springer-Verlag (1997).
Computers and Intractability: A Guide to the Theory of NP-Completeness, M. Garey and D. Johnson, WH Freeman (1979).




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