ECE 335 Discrete Mathematics with Applications

Fall

This course introduces students to fundamental concepts in discrete mathematics and their application to solve problems in computer engineering and computer science. Topics include sequential and quantified logic, proof techniques using sets, relations, and functions. Additionally, students will be introduced to the mathematics of recursion and algorithm efficiency, as well as graph, tree, and automata structures. Prerequisite: 2.0 or higher in CS 201.

3 credit hours