3 credits
Fall 2025 Lecture Distance Learning Upper DivisionThis 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.
Course ECE 369 from Purdue University - West Lafayette.