Algorithm Design
Bachelor of Engineering (BEng) · University · Computer Science
This unit introduces techniques for designing efficient algorithms, including divide-and-conquer, greedy algorithms, and dynamic programming. Students will learn to analyze the complexity of algorithms and apply appropriate techniques to solve real-world problems.
What's included
- Introduction to Algorithm Design
- Divide-and-Conquer Algorithms
- Greedy Algorithms
- Dynamic Programming
- Algorithm Complexity Analysis
- Time Complexity
- Space Complexity
- Big O Notation
- Recurrence Relations
- Amortized Analysis
- Applications of Algorithm Design
Keywords
- Algorithm Design
- Divide-and-Conquer
- Algorithm Complexity