Prerequisite(s): ( MTH231 )

Topics include: Functions, recursion, graphs of functions, coordinate diagrams, order notation, effciency of algorithims, relations, partially and totally ordered sets, (topological) graph and tree theory. The second course of a two-term sequence strongly recommended for computer engineering, computer science and mathematics majors.

This course may be taken 1 time for credit.