Combinatorics and discrete mathematics constitute the study of finite or countable structures and the algorithms that govern them. At its heart is enumeration: the art of counting arrangements, ...
Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...
Description: The course covers mathematics useful in analyzing computer algorithms. Topics include recurrence relations; evaluation of sums; integer functions; elementary number theory; binomial ...