MCS-31 Design & Analysis Of Algorithm (IGNOU Help book for MCS 31 in English Medium)
DESIGN AND ANALYSIS OF ALGORITHMS
● ELEMENTARY ALGORITHMICS
● SOME PRE-REQUISITES AND ASYMPTOTIC BOUNDS
● BASICS OF ANALYSIS
● DIVIDE-AND-CONQUER
● GRAPH ALGORITHMS
● DYNAMIC PROGRAMMING
● GREEDY TECHNIQUES
● MODELS FOR EXECUTING ALGORITHMS-I: FA
● MODELS FOR EXECUTING ALGORITHMS-II: PDFA & CFG
● MODELS FOR EXECUTING ALGORITHMS-III: TM
● ALGORITHMICALLY UNSOLVABLE PROBLEMS
● COMPLEXITY OF ALGORITHMS
