Discrete MathematicsCSC A67 / MAT A67

Computer Science / Mathematics

Course Description

September 4, 2015.

Introduction to discrete mathematics: Elementary combinatorics; discrete probability including conditional

probability and independence; graph theory including trees, planar graphs, searches and traversals, colouring. The course emphasizes topics of relevance to computer science, and exercises problem-solving skills
and proof techniques such as well ordering, induction, contradiction, and counterexample.
Instructors:

Richard Pancer. Office IC-490; phone (416) 287-7679;

email pancer@utsc.utoronto.ca.
Anna Bretscher. Office IC-493; email bretscher@utsc.utoronto.ca.

Office Hours:

Pancer: Tuesdays 11:30-12:30, Thursdays 5:10-6:00, Fridays 3:30-4:30, or by appointment.

Bretscher: Mondays 11:00-11:45, Wednesdays 11:30-12:30, or by appointment.

Website:

http://www.utsc.utoronto.ca/bretscher/a67

Lectures:

LEC01 Fridays 10:10-noon in AA-112, LEC02 Fridays 1:10-3:00 in AA-112,

LEC03 Tuesdays 9:10-11:00 in SW-143.

Tutorials:

Visit http://www.utsc.utoronto.ca/registrar/scheduling/timetable for times/locations.

Suggested Text: Stein, Drysdale and Bogart, Discrete Mathematics for Computer Scientists,
Addison-Wesley (Pearson), ISBN-13: 978-0-13-212271-9.
Grading:

Final Exam
Mid-Term Test
8 quizzes
8 exercises
2 assignments

- 35%
- 15%
- 6%
- 24%
- 20%

To pass this course, you need a total mark of at least 50%, and you must receive at
least 35% on the final exam.
The Term Test and Final Exam are both closed-book. No aids; no calculators.
Late policy:

Completed exercises and assignments must be submitted electronically on MarkUs

by the date and time shown on the handout. Late exercises will not be accepted.
Late assignments will be accepted up to 24 hours past the due time with a penalty
of 25%.
All quizzes are written in tutorial. A mark of zero is given if you do not attend.