|
|||
MATH 3530 - 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. Prerequisite(s): MATH 2350 Credit Hours: 3 Term Offered: Spring |
|||
|
All catalogs © 2026 Harding University. Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).
|
|||