Algorithms
Master of Science in Computer Science · University · Theory of Computation
This unit explores the design, analysis, and efficiency of algorithms. Students will learn fundamental algorithmic techniques and develop the ability to analyze and compare different algorithms for solving computational problems.
What's included
- Introduction to Algorithms
- Algorithm Design Techniques
- Algorithm Analysis Techniques
- Asymptotic Analysis
- Recurrence Relations
- Divide and Conquer Algorithms
- Greedy Algorithms
- Dynamic Programming
- Graph Algorithms
- String Matching Algorithms
Keywords
- Algorithm Design
- Algorithm Analysis
- Complexity Analysis
- Data Structures
- Recursion
- Divide and Conquer