Discrete Mathematics
Course Syllabus:
Meeting times: MW 3:30-4:45 pm
Meeting place: AC 111
Final Exam: 4:30pm-7:15pm Monday Dec 10 in AC 111
Office hours:
T,Th 2:00-4:00 pm
F 10:30-11:30 am
(or by appointment -- einsko@fgcu.edu)
Schedule:
Class assignments:
Course description:
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:
Discrete Mathematics, 5th edition, by Dossey, Otto, Spence, and Vanden Eynden, Addison-Wesley.
Class Resources:
Lecture 2 - Algorithms and their efficiency
Lecture 4 - Sets, operations, and relations
Lecture 5 - Partial Orderings and Functions
Lecture 9 - Multigraphs and Euler Circuits
Lecture 10 - Distance in Graphs and Shortest Paths
Lecture 11 - Directed Graphs and Multigraphs
Lecture 12 - Properties of Trees
Lecture 13 - Depth-First Search
Lecture 14 - Binary trees and traversals
Lecture 14 - Optimal binary trees
Lecture 15 - Pascal's Triangle and the Binomial Theorem
Lecture 15 -Three Fundamental Principles
Lecture 16- Permutations and Combinations
Lecture 16 - Arrangements and Selections with Repetition
Lecture 18 - Inclusion-Exclusion
Lecture 18 - Recurrence Relations
Lecture 19 - The Method of Iteration
Lecture 20 -- Linear Difference Equations with Constant Coefficients
Lecture 21 -- Counting with Generating Functions
Lecture 22 -- The Algebra of Generating Functions
Lecture 23 -- Boolean Algebra and Logical Gates
Lecture 23 -- Creating Combinatorial Circuits
Lecture 23 -- Supplementary Material
Homework Sets:
Quiz Archive: