Computational methods for discrete mathematical structures. Topics include representation of integers, sets, and graphs; counting and enumeration techniques; sorting and searching methods; and graph algorithms. A-E Only. LA Prerequisite(s):CSCI 2300 ”C” or better, and MATH 2500.
