Basic techniques of design for sequential, parallel and probabilistic algorithms including divide and conquer, greedy method, dynamic programming, etc. Prerequisites: Foundational courses, CMPSC F603 and CMPSC M612.