COURSE OUTLINE

Spring Semester 2010

Discrete Structures

The topics to be covered in this course include, but are possibly not limited to, the following list. For additional information, please contact Dr. Eggen.

• Introduction
• Formal Logic, Statements, symbolic representation
• Propositional logic, quantifiers, predicates
• Proofs, proof techniques, induction, recursion, recurrence relations
• Sets, notation, counting problems, permutations and combinations
• Relations, functions, matrices
• Graphs, representation, trees, decision trees
• Graph algorithms
• Boolean algebra, computer logic, networks, Karnaugh maps
• Modeling, arithmetic, algebraic structures, finite state machines, turing machines, formal languages.
• Advanced Topics

Return to Dr. Eggen's Home Page