This upper division course is for students majoring in the B.S. in Information Systems Technology or the B.S. in Electrical and Computer Engineering Technology programs. This course covers general techniques in algorithm design (such as divide-and-conquer, greedy method, dynamic programming, search and traversal techniques, branch-and-bound) in the context of problem domains like graph, sorting and optimization problems.
Prerequisites: COP1334, COP2270