|
|||
MATH 260 - Discrete Mathematical StructuresAn introduction to the basic techniques and concepts of combinatorial problem solving related to computer science applications. Topics include formal logic, counting methods, recurrence relations, graph theory, finite state machines and grammars. This class may make use of the testing center and/or may give exams outside of regularly scheduled class hours. Prerequisite(s): Prerequisite: MATH 201. Credit Hours: 3 Term Offered: Spring |
|||
|
All catalogs © 2023 Harding University. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|
|||