ECE 36900 - Discrete Mathematics for Computer Engineering

Lecture Hours: 3 Credits: 3

Counts as:

Normally Offered: Each Fall, Spring

Requisites:
ECE 27000

Catalog Description:
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.

Supplementary Information:
This is a required mathematics course for the BSCmpE. It counts as a Complementary Elective for the BSEE.

Required Text(s):
  1. 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:
  1. an ability to construct formal proofs in predicate logic. [1]
  2. an ability to construct informal proofs using a variety of mathematical techniques. [1]
  3. an ability to solve problems in combinatorics. [1]
  4. an ability to identify properties of mathematical relations. [1]
  5. an ability to identify properties of mathematical groups. [1]
  6. an ability to construct finite-state machines to recognize certain sets. [1]

Lecture Outline:

Week Topic
6 Formal Logic
3 Proof Techniques
3 Recursion and Recurrence Relations
2 Sets
4 Combinatorics
3 Relations
6 Functions
6 Algebraic Structures
3 Finite-State Machines
6 Turing Machines