ECEN 3703 - Discrete Mathematics for Computer Engineers
Required (ECEN majors) - 3 credit hours
On-Line Course Materials
Prerequisites: ECEN 1030 (or CSCI 1300) and APPM 1360, Calculus 2 for Engineers.
Textbook: Discrete Mathematics and Its Applications, Kenneth H Rosen, 5th Edition, McGraw-Hill.
Course Objectives: The purpose of this course is to review and integrate material the student has already seen and to introduce a number of new, interesting and useful topics in discrete mathematics. It introduces basic concepts in temporal logic, induction, proof techniques, relations (heavily utilized in formal verification of digital systems), graphs and trees. It prepares the student to work at higher levels of modeling and analytical sophistication. It is concerned with both the conceptual framework and with practical problem solving.
Topics:
Logic and Proof, Sets and Functions
- Logic
- Propositional Equivalences
- Predicates and Quantifiers
- Methods of Proof
- Sets
- Set Operations
- Functions
- Algorithms
- The growth of functions
- Complexity of algorithms
- Proof Strategy
- Sequences and Summations
- Mathematical Induction
- Recursive Definitions and Structural Induction
- Recursive algorithms
- Relations and their properties
- Representing Relations
- Closure of Relations
- Equivalence Relations
- Partial Orderings
- Graph Terminology
- Representing Graphs and Graph Isomorphism
- Connectivity
- Euler and Hamilton Path
- Shortest Path Problems
- Planar Graphs
- Graph Coloring
- Introduction to Trees
- Application of Trees
- Tree Traversal
- Spanning Trees
- Minimum Spanning Trees
Contribution of course to meeting the professional component: Contributes 3 semester hours to criterion 4(a) “one and one-half years of engineering topics, consisting of engineering sciences and engineering design appropriate to the student's field of study.”
Contribution of course to meeting the program criteria for electrical, computer, and similarly named engineering programs that include the modifier “computer” in the title: Satisfies the criterion that the program must demonstrate that graduates have a knowledge of discrete mathematics.
Relationship of course to program outcomes:
| 3a | 3b | 3c | 3d | 3e | 3f | 3g1 | 3g2 | 3h | 3i | 3j | 3k |
| H |
Prepared by: ECEN4703 Assessment Team: Michael Lightner (Chair),
Tom Mullis, Fabio Somenzi, William Waite, and by Vince Heuring
May 16, 2005
