Course Archives    Theoretical Statistics and Mathematics Unit

Course: Computer Science IV Level: Undergraduate Time: Currently not offered

Syllabus Past Exams Notes Syllabus: (Design and Analysis of Algorithms) Efficient algorithms for manipulating graphs and strings. Fast Fourier Transform. Models of computation, including Turing machines. Time and Space complexity. NP-complete problems and undecidable problems. Reference Texts: 1. A. Aho, J. Hopcroft and J. Ullmann: Introduction to Algorithms and Data Structures 2. T. A. Standish: Data Structure Techniques 3. S. S. Skiena: The algorithm Design Manual 4. M. Sipser: Introduction to the Theory of Computation 5. J.E. Hopcroft and J. D. Ullmann: Introduction to Automata Theory, Languages and Computation 6. Y. I. Manin : A Course in Mathematical Logic Top of the page Past Exams

Midterm 06.pdf 14.pdf 17.pdf Semestral 04.pdf 06.pdf 17.pdf Supplementary and Back Paper 17.pdf Top of the page Notes

Notes 1 Top of the page

[ Semester Schedule ][ Statmath Unit ] [Indian Statistical Institute]