DESIGN AND ANALYSIS OF ALGORITHMS (DAA)
by
PATHAN AHMED KHAN
Lecture Notes Unit Wise
DESIGN AND ANALYSIS OF ALGORITHMS (DAA) Notes Unit Wise | ||
Unit I | Introduction | |
Unit II | Divide- and Conquer | |
Greedy Method | ||
Unit III | Dynamic Programming | |
Backtracking | ||
Branch and Bounds | ||
Unit IV | Graph Algorithms & Graph Traversal Technique | |
Tries | ||
Unit V | Computational Complexity NP-Hard and NP-Completeness |
IMPORTANT QUESTIONS FOR CSE : Click Here
IMPORTANT QUESTIONS FOR IT : Click Here
LAB PROGRAMS: Click Here
DAA SYLLABUS : Click Here
Comments
Post a Comment