1)Introduction to algorithms and analysis
*Need for Analysis
*Analysis FrameWork.
*Types of analysis
*Asymptotic Notation and Apriory Analysis
*Time and space complexities
2)Design strategies
*Divide and conquer
*Greedy Method
*Dynamic Programming
(Backtracking and branch and bound)
3)Graph techniques
*Traversals
*Components
*Examples
4)Heap Algorithms
6)Sorting Algorithms
7)Intractability/NP completeness(Complexity theory)
Text books:-
1)Fundamentals of Computer Algorithms -Horowitz and Sahni
2)Introduction to Algorithms--Cormen
3)Algorithm Design -Tamasia Wiley publication
No comments:
Post a Comment