Sample data for Program 16
Java programs from
Course Notes .pdf file, Not complete
and may contain some typos.
Notes for 2nd semester algorithms course May
cover some of this material in 4400 [in postscript]
Sample final exam
Sample exam solutions
Schedule: (all dates tentative until announced). Other assignments may be
given in class.
Problems 0-2 Due W week 2: Jan 17
Problems 3-4 Due W week 3: Jan 24
Problems 5-10 Due W week 4: Jan 31
Problems 11-14 (problem 12 is optional) Due M week 5: Feb 5
Problems 15-20 Due W week 5: Feb 7 (you can use Master Theorem if
rather than induction or unfolding)
Problems 21-23 Due W week 6: Feb 14
Read over unassigned problems; be prepared to discuss in class.
Program 13 Due 5pm Fri week 7 (DUE 2/23/2017)
EXAM 1 (do review problems!) W week 7: Feb 21
Problems 1-5 Due W week 8: 2/28
Problems 6-7 Due W week 9: 3/7
Problems 10-12 Due W week 9: 3/7
Problems 13-14 Due W week 8: 3/7
Problems 16, 19-22, 24 W week 10: Due 3/14
Read over problems not assigned; be prepared to discuss in class.
EXAM 2 W week 12: 3/28 (do review problems!)
Problems 0, 0.1, 2, 4, 8, 10 Due: W week 13: 4/4
Program 18 Due 5pm Fri week 12, 4/20
Mini-paper Due last class before finals
Graduate Paper due last class before finals
Final Exam: will either be take-home (in which case it is due by 5pm
on the date of the scheduled final exam) or will be held at the time of
the scheduled final exam.
Appendix A of text by 8/30
Appendix B by 9/4
Sections 3.1-3.2 by 9/6
Visuallizations (Click Demo collection)
P vs NP survey
List of all small graphs Use "readable format" where it specifies the
number of graphs on line 1, vertices are numbered 0..n-1, and each other
line gives a graph with the number of vertices and edges, followed by the
actual edges (as pairs of vertices).
There are other resources available online, including Khan Academy, MIT online
courses, and others.