Lecture notes will be uploaded on the course website after every lecture. In addition, the following books cover most of the syllabus:
[DPV] S. Dasgupta, C. Papadimitriou, and U. Vazirani. Algorithms. McGraw Hill, 2006.
[KT] J. Kleinberg and E. Tardos. Algorithm Design. Addison Wesley, 2005.
[CLRS] T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2009.
[AHU] A. Aho, J. Hopcroft, and J. Ullman. Design and Analysis of Algorithms. Addison Wesley 1974.
[Ed] H. Edelsbrunner. CPS230 Lecture Notes. Duke University, 2008.
[Er] J. Erickson. CPS473G: Algorithms Lecture Notes. UIUC.
[Ta] R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial Mathematics, 1987.
We will be using a variety of teaching tools this semester.
Sakai: All grades will be compiled (not calculated) in Sakai's Gradebook.
Gradescope (accessible via Sakai): This is where you will submit assignments and receive feedback on them.
Panopto (accessible via Sakai): This is where recorded lecture videos will be posted.
Ed Discussion (accessible via Sakai): This is where most discussions outside of the synchronous course meetings will happen. If you have a question that does not have to go to a single specific instructor, this is the best place to ask! You will usually get a faster response on Ed Discussion than via email. This is also where course announcements will be made, though you should receive these posts via email as well.
OhHai: This is the office hours queueing system. Detailed instructions will be linked here and shared on Ed soon!