CSC 721, Theory of Algorithms Welcome to our little corner of the web. Here you will find downloads and miscellaneous information for our course, CSC721 Theory of Algorithms for Fall 2011. Course syllabus (Postscript) Course syllabus (PDF) Computer Science Cheat Sheet (PDF) Computer Science Cheat Sheet (Postscript) Example Turing Machine (Postscript) First proof of an NP-complete problem (Postscript) Proof that the clique problem is NP-complete (Postscript) Proof that the vertex cover problem is NP-complete (Postscript) Additional NP-complete problems (Postscript) Student work #1 (Postscript) Student work #2 (Postscript) Student work #3 (Postscript) Student FFT project (Postscript) Signed 16 bit sampled sound data Big-endian floating point (32 bit) sound data Little-endian floating point (32 bit) sound data Inverting a non-singular upper triangular matrix (Postscript) LUP Decomposition (Postscript) Final Exam Topics and Practice Problems (Postscript) Page illustrating 2-D Convolution / Deconvolution

Course syllabus (Postscript) Course syllabus (PDF) Computer Science Cheat Sheet (PDF) Computer Science Cheat Sheet (Postscript) Example Turing Machine (Postscript) First proof of an NP-complete problem (Postscript) Proof that the clique problem is NP-complete (Postscript) Proof that the vertex cover problem is NP-complete (Postscript) Additional NP-complete problems (Postscript) Student work #1 (Postscript) Student work #2 (Postscript) Student work #3 (Postscript) Student FFT project (Postscript) Signed 16 bit sampled sound data Big-endian floating point (32 bit) sound data Little-endian floating point (32 bit) sound data Inverting a non-singular upper triangular matrix (Postscript) LUP Decomposition (Postscript) Final Exam Topics and Practice Problems (Postscript)

Page illustrating 2-D Convolution / Deconvolution