##
G22.2340-001

Elements of Discrete Mathematics

Graduate Division, Computer Science

**Good luck on the final!**

**Course Schedule**

**Mailing List**

**Class Times:**

- Thursday nights, 6:00 - 8:20 pm, WWH 102
- First class: May 17, 2001
- Last class: August 2, 2001

**Instructor:**
- Zebadiah Kimmel
- Office Hours : Monday 6-7pm, WWH 401
- E-mail Address: kimmel@cs.nyu.edu

**Teaching Assistant:**
- Aleksandr Bukharov
- Office Hours : Tuesday 6:30-8pm, WWH 428
- E-mail Address: bukharov@cs.nyu.edu

**Textbook:**
*Discrete Mathematics with Applications*, 2nd Edition by Susanna Epp

**Grading:**
- Homeworks: 20%
- Midterm exam: 35%
- Final exam: 45%

**Homeworks and exams:**
- All homeworks are optionally
*collaborative* and may therefore either be done individually or within groups. If you work on an assignment as a group, you may turn in a single homework assignment for the entire group (as long as everyone is credited). You are still, of course, responsible for understanding all of the material on your own.
- Late homeworks are
*not* accepted.
- All exams are
*in-class*, *open-book* and *open-note*. You may use any books and notes and computers and additional inorganic aids that you like.
- There are
*no* make-up exams.
- Exams are
*not* collaborative and therefore *must* be done individually. Cheating on an exam (e.g. by looking at someone else's booklet during the exam) will immediately and irrevocably result in a failing grade for the course. Really.

**Notes:**

- I assume no prior knowledge of discrete math, and I will cover most of the textbook; this course will therefore move very quickly.
*You are responsible for reading the textbook.* Lectures will never parrot or duplicate the textbook, but rather will cover specific difficult points or sample problems.