Jan 18, 2026  
******DRAFT CATALOG 2026-2027****** 
    
******DRAFT CATALOG 2026-2027****** [ARCHIVED CATALOG]

Add to 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.

Prerequisite(s): MATH 2350 

Credit Hours: 3

Term Offered: Spring



Add to Favorites (opens a new window)