MA 260 Discrete Mathematics for Information Technology

Introduces basic discrete mathematical ideas, many of which were developed in the late 20th century to solve problems in computer science. Topics include elementary logic, Boolean algebras and combinatorial circuits, number systems, sets, counting, elementary probability, and an introduction to graphs and trees. Offered fall semester only. Prerequisite: a grade of C or better in a college-level mathematics course, complete University's Directed Self-Placement process with placement into MA 171 or MA 181, or permission of the instructor. Liberal Arts Core/University Requirements Designation: MT. (3)