Prerequisite

None

Syllabus mentioned in ERP

Sorting Algorithms, Greedy Algorithms, Graph Algorithms, Backtracking, Dynamic Programming, Minimum Spanning tree, shortest path, Max flow and min cut, String matching, Computational Geometry Algorithms, Number theoretic algorithms, Approximate algorithms, algorithms for parallel computations. Analysis of algorithms: P, NP, NP complete, NP-hard, Co-NP. Probabilistic analysis, Amortized Analysis.

Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

MA61022
Course name	Advanced Computer Algorithms
Offered by	Mathematics
Credits	4
L-T-P	3-1-0
Previous Year Grade Distribution
	{{{grades}}}
Semester	{{{semester}}}

Additional Resources