CMPS 400Analysis of Algorithms

University of La Verne · 4 credits

Catalog

PREREQUISITES: Completion of CMPS 385 and MATH 327 with a C- or better<br><br>Principles of algorithm design. Complexity of sorting and searching algorithms. Combinational and graph algorithms, divide and conquer algorithms, linear and dynamic programming and greedy algorithms. Methods for providing correctness and asymptotic analysis. Lab included. Not challengeable.

Recent sections

Spring 2027 · 1 section

Jan 11 – May 9

SectionDays & timeLocationInstructor
001Class #30976Tu Th · 10:20 – 11:55 AMMain CampusJuan Rodriguez