Techniques for designing algorithms including: analyzing algorithms (big-O, recurrence relations) and divide-and-conquer (quicksort, mergesort). Additional topics chosen from: the greedy method, dynamic programming, backtracking, branch-and-bound and string matching. PREREQUISITE(S): (CSC383 or CSC393) and MAT140. MAT141 Recommended.
Section: 501 ID#: 20039 Day: W Time: 1:30 - 4:45 PMInstructor: John Rogers Location: LOOP Room # Syllabi
Section: 510 ID#: 25179 Day: Instructor: John Rogers Location: DISTANCE Syllabi
This course is not being taught this quarter