ECE 227

Course Description

In this course, students will be introduced to the fundamental concepts of discrete mathematical structures and finite-state machines. They will gain proficiency in utilizing logical and mathematical formalisms to effectively tackle problems in the field of computer engineering. The curriculum covers various topics such as propositional logic, proof techniques, recurrence relations, sets, combinatorics, relations, functions, graphs, trees, and finite-state machines. Through comprehensive instruction and hands-on exercises, students will develop the necessary skills to apply these concepts and solve real-world challenges in the realm of computer engineering.

Learning Outcomes

Constructing formal proofs in propositional logic.
Constructing informal proofs using a variety of mathematical techniques.
Solving problems in combinatorics.
Analyzing running time complexity of algorithms
Identifying properties of mathematical relations.
Identifying properties of mathematical groups.
Constructing finite-state machines.
Identifying properties of graphs and trees.

Textbooks

On zybooks.com use the following code NCATECEN227NabilFall2020

Schedule

Date	Topic - Slides	Reading	Homework
Week 1-2	Course Logistics, Propositional Logic	Ch1	On Zybooks
Week 3	Proofs	Ch2	On Zybooks
Week 4	Sets	Ch3	On Zybooks
Week 5	Functions	Ch4	On Zybooks
Week 6-7	Algorithms	Ch5	On Zybooks
Week 8	Number Theory	Ch6	On Zybooks
Week 9-10	Induction and Recursion	Ch7	On Zybooks
Week 11	Counting	Ch8	On Zybooks
Week 12	Relations and Digraphs	Ch9	On Zybooks
Week 13	Graphs	Ch10	On Zybooks
Week 14	Trees	Ch11	On Zybooks

Disclaimer: This page may contain personal archived (pre-print versions) articles published by several publishers. Copyright and all rights therein are retained by authors or by other copyright holders. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the copyright holder.