ECE 36900 - Discrete Mathematics for Computer EngineeringLecture Hours: 3 Credits: 3
Normally Offered: Each Fall, Spring
This course introduces discrete mathematical structures and finite-state machines. Students will learn how to use logical and mathematical formalisms to formulate and solve problems in computer engineering. Topics include formal logic, proof techniques, recurrence relations, sets, combinatorics, relations, functions, algebraic structures, and finite-state machines.
This is a required mathematics course for the BSCmpE. It counts as a Complementary Elective for the BSEE.
- Mathematical Structures for Computer Science, 6th Edition, Judith L. Gersting, W. H. Freeman, 2006, ISBN No. 978-0716768647.
Recommended Text(s): None.
Learning Outcomes:A student who successfully fulfills the course requirements will have demonstrated:
- an ability to construct formal proofs in predicate logic. 
- an ability to construct informal proofs using a variety of mathematical techniques. 
- an ability to solve problems in combinatorics. 
- an ability to identify properties of mathematical relations. 
- an ability to identify properties of mathematical groups. 
- an ability to construct finite-state machines to recognize certain sets. 
|3||Recursion and Recurrence Relations|