The Department of Electrical Engineering & Computer Science

CATALOG DESCRIPTION: This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, functions, relations, databases, and finite automata; deterministic algorithms and randomized algorithms; analysis techniques based on counting methods and recurrence equations; trees and more general graphs.

• (Formerly EECS 310)
• This course is a required Core course in the CS curriculum in McCormick and Weinberg

PREREQUISITES: EECS 110 or EECS 111, and MATH 230