Discrete Mathematics in Computer Science

CS 280
Fall 2000

Announcements and Comments on Grading

Follow this link to the TA page, which contains announcements and elaborations to comments on graded problem sets.

(In particular, if your problem set says to check a comment on the Web, you should look at the relevant entry on this page.)

Basic Info:

Time: Monday, Wednesday, Friday 1:25-2:15 pm.
Place: Olin 255.

Staff

Instructor:
- Jon Kleinberg, 5134 Upson Hall, 255-3600. email: cs280@cs.cornell.edu
Teaching Assistants:
- David Feldman, email: dmf14@cornell.edu .
- Vadim Grinshpun, email: vg23@cornell.edu .
- Don Honeycutt, email: dwh6@cornell.edu .
- Junhwan Kim, email: jkim@cs.cornell.edu .
- Mikhail Kobyakov, email: msk15@cornell.edu .
- Chee Yong Lee, email: cl140@cornell.edu .
- Jon Ludwig, email: jml44@cornell.edu .
- Travis Ortogero, email: two1@cornell.edu .
- Joe Polastre, email: polastre@cs.cornell.edu .
- Aleksandrs Slivkins, email: slivkins@cs.cornell.edu .
Support Staff: Tammy Howe, 4119 Upson, 255-0957, email: thowe@cs.cornell.edu .

Getting in touch with us

To reach us electronically, please mail the course account cs280@cs.cornell.edu.

Office Hours

Mon. 2:30 - 3:30, Jon Kleinberg, (5134 Upson)
Tues. 2:00 - 3:00, Travis Ortogero (328 Upson)
Tues. 3:00 - 4:00, Mikhail Kobyakov, (328 Upson)
Wed. 10:15 - 11:15, Jon Kleinberg, (5134 Upson)
Wed. 11:15 - 12:15, Vadim Grinshpun (328 Upson)
Wed. 2:30 - 3:30, Chee Yong Lee, (328 Upson)
Wed. 3:30 - 4:30, David Feldman, (328 Upson)
Thurs. 2:00 - 3:00, Aleksandrs Slivkins (328 Upson)
Thurs. 3:00 - 4:00, Don Honeycutt (328 Upson)
Thurs. 4:00 - 5:00 Joe Polastre (328 Upson)
Thurs. 6:00 - 7:00, Jon Ludwig (328 Upson)

Handouts

Extra copies of handouts will be kept in 303 Upson, and on the racks outside. We will post some of the handouts to the course home page.

Final Exam Review Questions.

Prelim 2 Review Questions.

Further reading on the graph structure of the Web (optional).

A. Broder et al. Graph structure in the web. 9th International World Wide Web Conference, May 2000.

Further reading on association rules (optional). Especially, see the two papers

R. Agrawal, T. Imielinski, A. Swami. "Mining Associations between Sets of Items in Massive Databases" and
R. Agrawal, R. Srikant. "Fast Algorithms for Mining Association Rules"

Approximate Syllabus.

Problem Set 1 (due 9/8).

Problem Set 2 (due 9/15).

Problem Set 3 (due 9/22).

Problem Set 4 (due 9/29).

Problem Set 5 (due 10/20).

Problem Set 6 (due 10/27).

Problem Set 7 (due 11/6).

Problem Set 8 (due 12/1).

Prelims and Final

There will be two prelims during the semester, held in class.

Prelim 1: Wednesday, October 4, in class.
Prelim 2: Monday, November 13, in class.
Final: Friday, December 8, 3-5:30 pm.

Homework

There will be weekly homework sets, generally due on Fridays. Homework should be handed in in lecture, at the end of class, on the day it is due.

Late homeworks will not receive credit. (If a genuine emergency situation prevents you from handing in an assignment on time, come talk to one of us and we can work something out.)

Pre-requisites

The pre-requisite for the course is CS 211.

Grading

A rough breakdown of the course grade is as follows: 30% based on the homework, 20% based on each prelim, and 30% based on the final.

Books

The course textbook is

K. Rosen. Discrete Mathematics and Its Applications (4th edition). McGraw-Hill. 1999

Another book is on reserve in the Engineering Library as a background text:

S. Maurer and A. Ralston. Discrete Algorithmic Mathematics (2nd edition). A. K. Peters.

Academic Integrity

You are expected to maintain the utmost level of academic integrity in the course. Any violation of the code of academic integrity will be penalized severely.

You are allowed to collaborate on the homework to the extent of formulating ideas as a group. However, you must write up the solutions to each problem set completely on your own. You must also list the names of everyone that you discussed the problem set with.