Course: MATH 482. Combinatorial Algorithms (3)
Prerequisites: Completion of MATH 150B and MATH 262 with a grade of “C” or better; Some computer programming experience. Computer-oriented study of seminumerical and non-numerical algorithms. Sorting, tree searching, generation of combinatorial structures, algorithm proof techniques, best algorithms and programming complexity. Available for graduate credit.