Design and Analysis of Algorithms

This course studies the design, implementation and analysis of important algorithms. Topics include lower and upper complexity bounds, algorithm analysis techniques, NP-completeness, sorting algorithms, searching algorithms, graph algorithms, divide-and-conquer algorithms, greedy algorithms, dynamic programming, backtracking, probabilistic algorithms, and mathematical algorithms. Not open to students who have received credit for COSC 340. Formerly COSC 340. Prerequisites: COSC 201; and MATH 200 or MATH 281.

St. Mary’s College of Maryland reserves the right to provide some or all of the course content through alternative methods of course delivery, including remote methods of delivery, and it reserves the right to change the method of delivery at any time before or during the academic term, in the event of a health or safety emergency or similar situation when it determines, in its sole discretion, that such change is necessary and in the best interests of the College and the campus community.