Apr 8, 15:30-17:00
Teaching Assistant's problem sessions:
- Wednesdays 15:30-16:30 -- moved to CSEB 2013 for April 5
- Thursdays 16:00-17:00 -- moved to CSEB 2013 for April 6
Academic Honesty
It is important that you look at the departmental
guidelines
on academic honesty.
Solutions you hand in for homework assignments must be your own work.
Although you may discuss the general approach to solving a problem
with other people, you should never discuss the solution
in detail.
You must not take any written notes away from such a
discussion.
Also, you must list on the cover page of your solutions any
people with whom you have discussed the problems.
The solutions you hand in should be your own work. While
writing them, you may look at the course textbook and your own
lecture notes but no other outside sources.
Marking Scheme
There will be two tests during the term, a final exam during the final exam period, and homework assignments.
Let A be your average grade on assignments, T1 be your grade on test 1, T2 be your grade on test 2 and E be your grade on the final exam (all out of 100). Then your final grade will be 0.15*A + max(0.225*T1 + 0.225*T2 + 0.4*E, 0.15*T1 + 0.15*T2 + 0.55*E).
(See also March 1 announcement below.)
Announcements
- April 25: UNOFFICIAL grades for the course are now available. You can access them yourself if you have a CS account: log into one of the department's Unix machines and type "courseInfo 1019 2005-06 W". Come see me to pick up any old assignments or tests that you did not get back.
- April 7: I will be available in the late afternoon tomorrow (15:30-17:00p.m., Sat, April 8) in my office if students have questions before the exam. If you have trouble getting into the building, you can call me in my office (416-736-2100 ext. 33979.)
- April 6: Students in my section of the course will write the exam in SLH A.
- April 4: Solutions to assignment 5 have been posted below.
- Mar 22: There was a calculational error in my solution to question 3 of assignment 4. Replace 7464720 by 9601312 and replace 29858881 by 38405259.
- Mar 14: Test 2 will cover the following sections of the textbook: 3.2, 3.4, 4.1, 4.2, 4.3, 6.1, 6.2.
- Mar 14: For question 1(a) on assignment 4, people do not have to put on matching pairs of gloves, but each person has to put on one left glove and one right glove.
- Mar 13: There is a mistake on my solutions to the quiz. The answer for 3(c) should be 3^(n-2) + 3^(n-1) - 3^(n-3) = 11(3^(n-3)) because there are three letters in the alphabet, not two.
- Mar 4: Assignment 4 has been posted below.
- Mar 1: There will be an extra-credit quiz on Friday, March 10 during class. It will probably last about 30 minutes. It is "optional" in the sense that it is not part of the original marking scheme. Marks that you earn will just be added on top of your final mark. (It will be worth a maximum of a few percent on your final mark.) If you miss it for any reason, there is no makeup quiz (since it is optional anyway). The quiz will cover the material we have done lately: Sections 2.2, 3.2, 3.4, 4.1, 4.2, 4.3.)
- Mar 1: The final exam schedule has been posted on the Registrar's web site.
- February 24: Course evaluations will be done at the end of class on March 22.
- February 19: If you have an account on the CS machines, you can
look at my record of your marks. Log in to one of our unix machines and type
"courseInfo 1019". (The marks for test 1 are included).
- February 9: I will be away (and probably not checking email) during reading week, Feb 13-17. There will not be office hours that week.
- February 6: You don't have to hand in question 5 on Assignment 2. It will be part of Assignment 3 instead.
- January 25: Rooms for the TA problem sessions are posted above. They start in those locations tomorrow. The second assignment is posted below.
- January 25: In the readings listed below, I forgot to include section 3.1 earlier. You should read it.
- January 18: As mentioned in class, there will be a problem session with the course's TA tomorrow (Jan 19). This week only, it will be in CSEB 3033 from 4:30-5:30. Come with questions (The room for regular sessions has not been booked yet.)
- January 16: The first test date has been posted below.
- January 6: Follow this link for a memo from Professor van Wijngaarden to all science and engineering students about the search for a new Dean of the faculty.
Important Dates
| First class | January 4 |
| Assignment 1 posted below | January 11 |
| Assignment 1 due | January 25 |
| Assignment 2 posted below | January 25 |
| Test 1 (during class) | February 6 |
| Assignment 2 due | February 10 |
| Assignment 3 handed out | February 10 |
| Reading week (no classes) | February 13-17 |
| Assignment 3 due | March 3 |
| Assignment 4 posted below | March 4 |
| Drop deadline | March 10 |
| Assignment 4 due | March 17 |
| Test 2 (during class) | March 20 |
| Assignment 5 posted below | March 21 |
| Assignment 5 due | April 3 |
| Last class | April 3 |
Resources
Textbook
-
Kenneth H. Rosen. Discrete Mathematics and Its Applications, Fifth Edition. McGraw-Hill, 2003. Textbook web site.
Other References
- Norman L. Biggs. Discrete Mathematics. Oxford University Press, 2002.
- Alan Doerr and Kenneth Lavasseur. Applied Discrete Structures for Computer Science. Science Research Associates, 1985.
- Gary Haggard, John Schlipf and Sue Whitesides. Discrete Mathematics for Computer Science. Thomson, 2006.
- Rod Haggarty. Discrete Mathematics for computing. Addison-Wesley, 2002.
- Bernard Kolman, Robert C. Busby and Sharon Cutler Ross. Discrete Mathematical Structures. Pearson, 2004.
- Edward Scheinerman. Mathematics: A Discrete Introduction. Thomson, 2006.
- Daniel Solow. How to Read and Do Proofs: An Introduction to Mathematical Thought Processes. Wiley, 2002.
- Andrew Wohlgemuth. Introduction to Proof in Abstract Mathematics. Saunders College Publishing, 1990.
Web Links
Reading
This section will be filled in as we go. These readings refer to
sections of the course textbook.
When a section is assigned as
reading, you should do a significant number of the associated
exercises as practice.
It is important not to fall behind with your reading.
-
Logic: read 1.1, skim 1.2, read 1.3 and 1.4.
-
Proof techniques: read 1.5, 3.1, 3.3. (The book by Daniel Solow listed
above is a good secondary reference for this part of the course.)
-
Sets: read 1.6, 1.7.
-
Functions: read 1.8.
-
Asymptotic notation: 2.2.
-
Sequences and sums: 3.2.
-
Recursive definitions: 3.4.
-
Counting: 4.1, 4.2, 4.3.
-
Recurrences: 6.1, 6.2, 6.3.
-
Relations: 7.1, 7.5, first 4 pages of 7.6.
Course Handouts
Updated April 25, 2006