Loading course details…
MAT 2013Discrete Mathematics
Lincoln University · 4 credits · UGRD
Catalog
This course is designed as an elementary introduction to the discrete mathematical structures of computer science. Topics include sets, logic, Boolean algebra, combinatorics, graphs, trees, semigroups, groups, and examples of automata.
Recent sections
Fall 2026 · 1 section
Aug 24 – Dec 12
| Section | Days & time | Location | Instructor |
|---|---|---|---|
| 01Class #9982-MAT-2013-01 | Monday, Wednesday, Friday 10:00 AM - 11:10 AM Science Bldg 128 (Lecture) | Science Bldg 128 | Ranjan Naik |