Course Archives Theoretical Statistics and Mathematics Unit

Course: Special Topics - Computer Science IV Level: Postgraduate Time: Currently not offered

Syllabus Past Exams 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. Suggested Texts : (a) A. Aho, J. Hopcroft and J. Ullmann: Introduction to Algorithms and Data Structures (b) T. A. Standish: Data Structure Techniques (c) S. S. Skiena: The algorithm Design Manual (d) M. Sipser: Introduction to the Theory of Computation (e) J.E. Hopcroft and J. D. Ullmann: Introduction to Automata Theory, Languages and Computation (f) Y. I. Manin : A Course in Mathematical Logic Top of the page Past Exams

Midterm 23.pdf Semestral 23.pdf Supplementary and Back Paper 23.pdf Top of the page

[ Semester Schedule ][ SMU ] [Indian Statistical Institute]