Introduction to Algorithms
Master of Engineering (MEng) · University · Computer Science
This unit introduces the fundamental concepts of algorithms, their analysis techniques, and the notations used to describe their complexity. Students will gain a deep understanding of algorithm design and analysis, which are essential skills for computer scientists.
What's included
- Introduction to algorithms
- Algorithm design paradigms
- Algorithm analysis techniques
- Asymptotic analysis
- Time complexity
- Space complexity
- Divide-and-conquer algorithms
- Greedy algorithms
- Dynamic programming algorithms
Keywords
- Algorithm Design
- Algorithm Analysis
- Time Complexity
- Space Complexity
- Big O Notation
- Asymptotic Analysis
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming