Prerequisites: A grade of C or better in CpSc 101 or CpSc 111 or CpSc 210;
and a grade of C or better in a calculus course such as MTHSC 102 or MTHSC 106.
Text:
Discrete Mathematics for Computer Scientists , by Stein, Drysdale, Bogart, Addison-Wesley, 2011.
Course content:
CPSC 207 is an introduction to Discrete Mathematics for computer science students.
It is a mathematically rigorous course, involving definitions, theorems, and proofs.
Correct mathematical notation will be required.
Topics include Counting Principles, Cryptography and Number Theory,
Mathematical Logic, Recursion and Induction, Probability Theory, and Graph Theory.
Dates:
Last day to drop without W: Wednesday, January 25
Last day to drop with W: Friday, March 16
Attendence policy:
A student not attending the first class will be dropped from the course, according to
university policy.
You are expected to attend every lecture.
Grading policy: A final course average of 90%, 80%, 70%, 60%,
will guarantee a course grade of A, B, C, D respectively.
There will be several graded homework assignments, some unannounced quizzes,
and two longer in-class exams, in addition to a final exam.
It is possible that on some days, in place of a quiz,
attendence will simply be taken.
Graded assignments will be collected at the beginning of class,
on the day they are due. Late assignments are not accepted.
A student absent for a quiz will receive a zero.
There will be no make-up tests provided.