An introduction to discrete structures in mathematics. Topics covered include algorithms, induction and recursion, counting methods, discrete probability distributions, graphs, and trees, with use of technology for exploring concepts and creating simulations. Prerequisite: Mathematics 160 with a “C” or better. (Offered in Fall Semester of even years.) Credit, 3 hours.