Course Description: This is a 4-unit transferable course in discrete mathematics appropriate for
computer applications, for students who have passed precalculus algebra (Math 1, Math 2 or high
school precalculus) with a C or better or have a qualifying score on the placement exam. The
course topics are drawn from logic, sets, graph theory, trees, proof techniques, functions,
relations, combinatorics, the theory of algorithms, finite state machines and recursion.
Student Learning Outcomes:
1. Determine whether two logical expressions in either propositional or predicate logic are
equivalent through the use of truth tables or rules of logical equivalence.
2. Given a graph, find a Hamiltonian or Eulerian path and the chromatic number.
3. Given two graphs, check to see if they are isomorphic.
Required Textbook: Discrete Mathematics and its Applications by Kenneth H. Rosen, 7th
Edition, ISBN 9780073383095. An electronic version (Smart Book) of the text is also available.
To purchase it, go directly to the publishers website rather than through the campus bookstore:
http://shop.mheducation.com/highered/product.M0073383090.html.
Office Hours: I am available at these times to help you with your coursework, so please drop by
or call whenever you have questions or want to talk to me about the class. No appointment is
needed for these times; other times to meet can also be arranged.
MTWTh
8:30 9 am
Wednesdays 12:302 pm
SM 3B
SM 5 (Math Resource Center)
60%
20%
20%
GRADE SCALE:
A 90-100%
D 60-69%
B 80-89%
F 0-59%
C 70-79%