Introduction to the Design and Analysis of Algorithms
COMPSCI 330
Design and analysis of efficient algorithms including sorting, searching, dynamic programming, graph algorithms, fast multiplication, and others; nondeterministic algorithms and computationally hard problems. Prerequisites: Computer Science 201; and one of 230, 231 or 232.
Prerequisites
Prerequisite: Computer Science 201, and Computer Science 230, 231D or 232