Discrete Mathematics Fall 2017

Course Syllabus:

MAD 3107 is an introduction to concepts of discrete mathematics, as used by computer scientists.  

Topics include: symbolic logic and Boolean algebra, prepositional and predicate calculus, sets, 

functions, and relations, enumeration and counting principles, introduction to graphs, trees, 

spanning trees, shortest path and matching algorithms, finite state automata, and Turing machines.

Prerequisities:

MAC 2312 with a minimum grade of C.

Course text:

There is no required text, but I will distribute notes and readings from a number of open-source resources and texts.

Some interesting research papers in related subjects:

• Roman Domination of Grids and Toroidal Grids 

• (t,r) Broadcast Domination of Grids

• Broadcasting Domination in Graphs

• Capturing a Drunk Robber on a Graph

• The Robber Strikes Back!

• Braess' Paradox in Wireless Networking