Analysis of Algorithms

MET CS 566

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.

FALL 2026 Schedule

Section Instructor Location Schedule Notes
A1 Zhang CAS 228 M 6:00 pm-8:45 pm

FALL 2026 Schedule

Section Instructor Location Schedule Notes
A2 Belyaev CAS 203 T 6:00 pm-8:45 pm

FALL 2026 Schedule

Section Instructor Location Schedule Notes
O1 Zhang ARR 12:00 am-12:00 am Students are assigned to class sections of about 20 with a member of the teaching team. Student visa holders must contact their advisor for approval before registering for any online class.

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