Course Archives Theoretical Statistics and Mathematics Unit
Course:Data Structures and Algorithms
Level: Postgraduate
Time: Currently not offered
Syllabus: Basic - notations; Sorting, Searching, Selection; Basic Graph Algorithms - BFS, DFS, applications; Minimum spanning tree algorithms and analysis (through heaps and disjoint set union); Shortest paths (single source, all pairs); Basic data structures - array, linked lists, stacks, queues; Heaps, Binary Search Trees (AVL, Red-black, B-trees); Algorithmic Techniques - Divide and Conquer; Greedy
Intermediate - Network Flows and matching; Amortization (Fibonacci heaps, splay trees); Dynamic Programming (perhaps through examples in exponential algorithms); Matrix Algorithms, Linear Programming introduction (duality etc); Lower Bounds (adversary, decision tree) and NP-completeness; NP-complete coping strategies: introduction to Approximation, Parameterized complexity

Past Exams


Syllabus:

Suggested Texts :
Top of the page

Past Exams
Midterm
15.pdf
Semestral
15.pdf
Supplementary and Back Paper

Top of the page

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