Analysis Design of Algorithm (CS402)-Computer Science and Engineering (IV-Semester) | RGPV

---

• Syllabus

• Syllabus - Analysis Design of Algorithm (CS402)

• Design and Analysis of Algorithms

• Introduction to Algorithms
• Asymptotic Notations
• Heap and Heap Sort
• Divide and Conquer Technique

• Greedy Strategy and Dynamic Programming

• Greedy Strategy
• Dynamic Programming

• Backtracking, Branch & Bound Method and Lower Bound Theory

• Backtracking
• Branch & Bound Method
• Lower Bound Theory

• Trees and Graphs

• Binary Search Trees
• Balanced and Multiway Trees
• Search and Traversal Techniques
• NP-Completeness