Algorithm Design
Greedy, divide-and-conquer, dynamic programming and graph algorithms.
CMP-301 Year 3 3 credits 5 lessons planned
Offered by HSM University · Computer Engineering
Course content
- 1Greedy algorithmsComing
- 2Divide and conquerComing
- 3Dynamic programmingComing
- 4Graph algorithmsComing
- 5NP-completenessComing
Requirements
Recommended background. You can start any course at any time.
Description
Greedy, divide-and-conquer, dynamic programming and graph algorithms.
Part of the Engineering stream, typically taken in year 3.