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) .

COMP_SCI 396, 496: Advanced Algorithm Design through the Lens of Competitive Programming VIEW ALL COURSE TIMES AND SESSIONS Prerequisites CS 336 or Permission of Instructor ... This course examines ...

Specialization: Data Science Foundations: Data Structures and Algorithms Instructor: Sriram Sankaranarayanan, Assistant Professor Prior knowledge needed: We highly recommended successfully completing ...

Dynamic programming (DP) algorithms have become indispensable in computational biology, addressing problems that range from sequence alignment and phylogenetic inference to RNA secondary structure ...