Algorithms

Catalog description

The course covers fundamentals in algorithm design and analysis and provides practice in professional algorithm writing and presentations. Loop invariants, asymptotic notation, recurrence relations, sorting algorithms, divide-and-conquer, dynamic programming, greedy algorithms, basic graph algorithms. Counts as a Disciplinary Communication course. Prereq: ( CSDS 302 or ECSE 302 or MATH 304 with a C or higher) and ( CSDS 233 or ECSE 233 with a C or higher).