MATH 320Discrete Math

Indiana State University · 3.000 credits · UGRD

Catalog

Sets, relations, functions, graphs, trees, and networks; propositional and predicate logic; combinatorial methods; recursion and iteration; applications of discrete structures that could include linear programming and designing data structures. Prerequisites: A grade of C or better in MATH 132.

Recent sections

Fall 2026 · 1 section

Aug 18 – Dec 11

Section	Days & time	Location	Instructor
001Class #51779	Tu Th · 12:30 – 1:45 PM	Root Hall A011	Winnie Ko
001 notes: Instructional method: Face to Face