COURSE TITLE: EECS 310 Mathematical Foundations of 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.

COURSE COORDINATOR: Ming-Yang Kao

PREREQUISITES: EECS 110 or EECS 111, and MATH 214-3

TIME: This course will be offered in Fall, 2006.