Javascript is currently not supported, or is disabled by this browser. Please enable Javascript for full functionality.

Skip to Main Content
    Harding University
   
 
  Dec 05, 2025
 
2020-2021 Academic Catalog 
    
Catalog Navigation
  Catalog Home
   **Return to Current Catalog**
   Archived Catalogs
   Programs of Study
   University Learning Outcomes
   Liberal Arts Requirements
   Course Descriptions
   College of Arts & Humanities
   College of Bible & Ministry
   Paul R. Carter College of Business Administration
   Cannon-Clary College of Education
   College of Sciences
   Honors College
   University College
   Center for Health Sciences
   College of Allied Health
   Carr College of Nursing
   College of Pharmacy
   Interdepartmental Programs
   School of Theology
  My Favorites
HELP
2020-2021 Academic Catalog [Archived Catalog]

Print-Friendly Page (opens a new window)
Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to My Favorites(opens a new window)

MATH 3530 - Discrete Mathematical Structures

An 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): MATH 2350  with a grade of “C” or higher.

Credit Hours: 3

Term Offered: Spring



 Back to Top | Print-Friendly Page (opens a new window)
Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to My Favorites(opens a new window)
   
All catalogs © 2025 Harding University.
Powered by the Acalog™ Academic Catalog Management System™ (ACMS™).