Prerequisites: MET CS 342 or MET CS 526 or consent of instructor. Learn methods for designing and analyzing algorithms while practicing hands-on programming skills. Topics include divide-and-conquer, sorting, dynamic programming, greedy algorithms, advanced data structures, graph algorithms (shortest path, spanning trees, tree traversals), matrix operations, and NP-completeness.

Note that this information may change at any time. Please visit the MyBU Student Portal for the most up-to-date course information.