MATH 354 - Analysis of Algorithms

Units: 3
Three hours lecture per week
Prerequisite: MATH 300 and some computer programming experience
Computer-oriented study of seminumerical and non-numerical algorithms. Topics include: sorting, tree searching, generation of combinatorial structures, algorithm proof techniques, best algorithms, programming complexity, and string matching.