CSC238H: Discrete Mathematics for Computer Science
Instructor: Eric Ruppert
Office: SF 4008G
Office Hours: Mondays 5:30 p.m. to 7:00 p.m. in SF2304A (or by appointment)
A course description from the Arts and Science Calendar.
Exercises on regular languages
As promised on the exam review sheet, here is a list of some exercises on regular languages that might be helpful in reviewing for the exam:
We didn't have time to cover pages 262-287 of the text, alas. You can use that part of the text for light summertime reading in a nice hammock or at the beach after the exam.
- pp. 224-227: #2-4,6-10,19a
- pp. 233-234: #5,8,9,10,13
- pp. 241-242: #1,2,5-8,11
- pp. 248-249: #1,4,6,7,10-16
- pp. 258-261: do a few
Here is a list of marks from August 11. It includes the marks for Assignment 3. The last column shows your term mark (i.e. how many of the 60 marks for term work you have earned).
About the Textbook
The text is fairly different from the one that was used in previous terms. (The changes were made in response to students' complaints about the old textbook.) About 45 pages are new, and some material from the old text was removed. The pages were renumbered for the new material, so it might be a little inconvenient for you to use an old version of the text.
The tutorial sections have been rearranged since we now have five TAs instead of four. The division of students (according to colleges) is given below. Each week, you may go either to the standard tutorial for your college or to the remedial tutorial. Go to the remedial tutorial if and only if you are having difficulty with the current material; you will probably be bored in the remedial tutorial if you are not having too many problems with the current material. Quizzes are held in all tutorial sections.
GB 244 for standard tutorial 1 (Erindale, New, PHE) with Geneviève Arboit (email@example.com),
GB 119 for standard tutorial 2 (Trinity, Innis, Scarborough)
with Alex Budanitsky (firstname.lastname@example.org),
GB 120 for standard tutorial 3 (Victoria, St Michael's, Engineering)
with Steve Myers (email@example.com),
SF 3109 for standard tutorial 4 (Woodsworth, University)
with Eugenia Ternovskaia (firstname.lastname@example.org), and
SF 1101 for the remedial tutorial with Joe Rainsberger (email@example.com).
To view a course handout, select one of the following links. Most of the documents are in PostScript format. (You can use the programme called ghostview to view the PostScript files; click here to get a copy of ghostview for your computer.)
Assignments and Solutions
(I have taken the solutions offline as of June 1999.)
Quizzes and Tests
Other Web Pages
Select the following links to see web pages for some previous versions of the course. These pages include assignments, tests and solution sets.
Updated August 18, 1998
- A proof system for predicate logic (We won't have time to cover this proof system; I just put it here for people who are interested. These notes are by Faith Fich. For simplicity, it is assumed in these notes that there are no function symbols, but the system can be adapted to handle function symbols too.)
- A challenging puzzle that will test your understanding of induction and logic. (New: This puzzle, and some related problems are discussed in Ian Stewart's Mathematical Recreations column in this month's (August 1998) Scientific American.)
Send bug reports to Eric Ruppert (firstname.lastname@example.org)