CS3310: Design and Analysis of Algorithms

Topics

Ch 1. Introduction

• Introduction

Ch 2. Analysis of Algorithm Efficiency

• Algorithm Analysis Fundamentals
• Mathematical Foundations for Algorithm Analysis
• Analyzing Nonrecursive Algorithms
• Analyzing Recursive Algorithms

Ch 3. Brute Force

• Brute Force
• Graphs
• Closest-Pair Problem

Ch 4. Decrease and Conquer

• Decrease and Conquer

Ch 5. Divide and Conquer

• Divide and Conquer

Ch 6. Transform and Conquer

• Transform and Conquer

Ch 7. Space and Time Trade-offs

• Space and Time Trade-offs

Ch 8. Dynamic Programming

• Dynamic Programming

Ch 9. Greedy Technique

• Greedy Technique

Ch 10. Iterative Improvement

• Iterative Improvement

Exam Notes

• Midterm 2
• Final Exam