An introduction into discrete structures. Topics may include propositional calculus, sets and operations, functions and relations, induction, principles of counting, sequences and summations, the binomial theorem, divisibility and modular arithmetic, equivalences and partial orders, graphs and shortest path algorithms, trees and minimal spanning trees, tree traversal, and elements of boolean algebra. Prerequisite: C or better in MATH 1426 or HONR-SC 1426.