Course Archives    Theoretical Statistics and Mathematics Unit
Course: Computer Science III
Instructor: Utpal Chattopadhyay
Room: Computer Class Room
Level: Undergraduate
Time: Currently offered
Past Exams

Syllabus: (Data Structures) Fundamental algorithms and data structures for implementation. Techniques for solving problems by programming. Linked lists, stacks, queues, directed graphs. Trees: representations, traversals. Searching (hashing, binary search trees, multiway trees). Garbage collection, memory management. Internal and external sorting.

Reference Texts: Data Structures Using C and C++ 2 Edition, by Yedidyah Langsam, Aaron M. Tenenbaum, Moshe J. Augenstein, PHI 2009

Midterm Exam 30 marks
Assignment 20 marks
Final Exam 50 marks
Total 100 marks

Top of the page

Past Exams
03.pdf 06.pdf 07.pdf 11.pdf 14.pdf 17.pdf 18.pdf 19.pdf
03.pdf 06.pdf 07.pdf 08.pdf 09.pdf 14.pdf 17.pdf 18.pdf 19.pdf
Back Paper

Top of the page

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