News
It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .
Students will practice algorithm design to solve complex computing problems. Exploration of algorithmic paradigms such as greedy algorithms, divide and conquer algorithms, and dynamic programming.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results