Computer Science Department Kurt VanLehn 2 23
2002-01-07T04:38:00Z 2002-08-23T13:10:00Z 2002-08-23T13:10:00Z 1 330 1886
|
Instructor: Prof. Kurt VanLehn |
TA: Ms. Larkan Berfield |
|
Office: 823 LRDC |
Office: |
|
Phone: (412) 624-7458 |
Phone: (412) 624-8414 |
|
Home Page: http://www. pitt.edu/~vanlehn |
|
|
Hours: Immediately after class & by appt. |
Hours: M 11:30-12:45, 3:30-4:45; W 11:30-12:45 |
|
Day |
Time |
Place |
|
Lecture (MW) |
10:00AM - 11:20AM |
Public Health A215 |
|
Recitation (F) |
10:00 AM - 10:50 AM |
SENSQ 5129 |
|
Recitation (F) |
11:00 AM - 11:50 AM |
SENSQ 5129 |
Note:
Textbook: Discrete Mathematics and Its Applications, 4th Edition, Kenneth Rosen, WCB McGraw Hill Publishing Co., 1999.
Grading:
|
Exams |
Class
participation |
Homework |
|
Exam 1 22% |
10% |
24% |
|
Exam 2 22% |
||
|
Exam 3 22% |
Regulations:
Homework assignments: Completing and solving homework assignments is essential for success on the exams. It is your responsibility to meet with the course assistant when experiencing difficulty with homework problems. Homework problems will be handed in and discussed at recitation. I encourage you to work on homework together with your friends. This kind of collaboration will result in learning if everyone contributes to the discussion. Except for the first homework assignment, homework may not be handed in late. If you do not bring your homework to recitation, you will get a zero for that assignment. However, since we all get ill sometimes, I will not count the homework assignment that you get the lowest grade on. For instance, if we end up doing 13 homework assignments, and you get a zero on one of them, then I will compute your homework grade by taking the average of the 12 remaining assignments.
Collaboration is NOT allowed on exams: Any form of cheating, copying, or collaboration on exams will result in a failing grade for the course. No make-up exams will be offered
Tentative Schedule:
|
Dates |
Topics |
|
|
September |
Logic, sets, & functions |
1.1 - 1.7 |
|
October |
Induction, proof methods |
3.1-3.3 |
|
|
Binary relations and properties 0-1 matrices |
6.1 - 6.3 |
|
November |
Equivalence relations, partial orders |
6.4 - 6.6 |
|
|
Counting methods and probability |
4.1 – 4.4 |
|
December |
Bayes Theorem and Inclusion-exclusion |
4.5, 5.4 |