CMPS 201
Analysis of Algorithms
Fall 2017


 
Final Exam: Wednesday December 13, 8:00-10:00 am  
Please bring your official UCSC student ID to the exam

Syllabus  
Canvas    
Piazza   
Homework Assignments   hw8 solutions posted           
Handouts  
  
Notes  
Webcasts      

Midterm 1 Review Problems   Solutions to Selected Review Problems
Midterm 1 Solutions  

Midterm 2 Review Problems  
Midterm 2 Solutions  

Final Exam Review Problems  


Time and Place:  TTh  9:50-11:25 am  Thimann Lecture 001       
Class Webpage: https://classes.soe.ucsc.edu/cmps201/Fall17/


Instructor: Patrick Tantalo (http://www.cse.ucsc.edu/~ptantalo/) 
Office: E2 255 
Office Hours:   TTh 1:00-3:00, W 10:00-12:00, or by appointment 
Email: ptantalo@soe.ucsc.edu 

Teaching Assistants: 
Zhichao Hu (zhu@ucsc.edu)
Anastasia McTaggart (amct@ucsc.edu)

TA Office Hours:
Zhichao:   Tuesday   1:00- 3:00 PM  Baskin 119
Anastasia: Wednesday 8:00-10:00 AM  Baskin 312
  


Discussion Sections:
  

Monday 09:20AM-10:25AM  Baskin 156    Anastasia
Monday 05:20PM-06:25PM  Baskin 156    Anastasia
Friday 12:00PM-01:05PM  Baskin 156    Zhichao
Friday 01:20PM-02:25PM  Baskin 156    Zhichao 



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