COEN 321B Discrete Mathematics for Computer Engineering
Provides the discrete mathematical foundations essential for computer engineering analysis and design. Topics include propositional and predicate logic, methods of proof, set theory, relations and functions, combinatorics, recurrence relations, Boolean algebra, graph theory, and finite-state machines. Emphasis is placed on applying discrete mathematical reasoning to problems in logic circuits, algorithms, computer architecture, and network modeling. Students gain the abstraction and problem-solving skills required for upper-level courses in digital systems, computer organization, and embedded system design.
Prerequisite
Grade of "C" or better
MATH 364B