Student
Solutions Guide, 6th Edition (recommended), Kenneth H. Rosen, McGraw Hill,
ISBN 0-07-310779-4

Course Goals:

This course provides
students with an introduction to the mathematical concepts fundamental to
computer science.

Topics Covered:

Topics include an
introduction to predicate and propositional calculus; sets and set
operations; functions and mappings; big-O notation and the growth of
functions; algorithms, integers, and matrices; mathematical induction and
recursive definitions; combinations, permutations, and binomial coefficients;
Students will also learn formal methods for writing mathematical proofs

Attendance Policy:

Class
attendance is MANDATORY. Absences for legitimate professional activities and
illnesses are acceptable only if prior notice is given to the instructor by
e-mail or phone. Scheduling conflicts with your work, extra-curricular
activities, or any other such activities is not a valid excuse.