Honors Computer Science 102 --- Data Structures
Fall 2007

COURSE DESCRIPTION

This is the second course in computer science. The course is about data structures. Java will be the programming language for purposes of class discussions and homework. Here's an approximate list of the topics that we will cover: Students are responsible for reading the relevant portions of the textbook.

ADMINISTRIVIA

TIME:  Lectures on Tuesdays and Thursdays, 2:00 to 3:15PM.
PLACE:  719 Broadway, Room 709
PROFESSOR:  Dan Melamed (http://www.cs.nyu.edu/~melamed/)
Office: 715 Broadway, #707
Office hours: Thursdays, 4:00-5:00PM or by appointment
Email: {lastname} at cs dot nyu dot edu
E-TUTOR/Grader:  Paul Chung (pc897 at nyu dot edu)
CLASS MAILING LIST:  Sign up immediately at http://www.cs.nyu.edu/mailman/listinfo/v22_0102_001_fa07 !
PREREQUISITE:  Computer Science 101, or permission of instructor.
TEXTBOOK:  Data Structures & Algorithms in Java, 4th Edition
by Michael Goodrich and Roberto Tamassia
GRADING SCHEME:  There will be one midterm exam worth 35%, and a final worth 40%. There will also be about 5 assignments (programming and written) due throughout the semester, worth a total of 25%.
You cannot pass the course unless you do all of the assignments.
LATE POLICY:  25% is deducted for each day of lateness. If more than 3 days late, you will get no credit for the assignment, but you must still do it to pass the course.
Assignments:  #1   #2   #3   #4   #5   Here are the rules and a checklist for programming assignments.
MIDTERM EXAM:  Thursday, October 18, on Chapters 3--6 except sections 4.3, 6.4 and 6.5.
LAST CLASS:  Tuesday, December 11
FINAL EXAM:  Tuesday, December 18, 2-3:50PM, in Room 709 of 719 Broadway (our usual classroom), on the entire textbook EXCEPT sections 4.3, 6.5, 8.4, 9.4-9.5, 10.3-10.5, 11.4-11.7, 12.5, 13.5-13.7, and chapter 14.

CLASS MAILING LIST

All students should sign up for the class mailing list. You should use the list to ask questions about the course, the assignments, etc. Your questions will usually be answered faster if you use the list than if you email the instructor, because the e-tutor, the TA, or another student might get to it sooner than the instructor.

COLLABORATION

You may discuss general problem-solving strategies for the assignments with your classmates, but you may not discuss or share code or actual solutions. I am doing research on automatic plagiarism detection. If you don't object, I will use your submitted assignments as test data (of the kind where nothing will be detected of course :) .

ADDITIONAL RESOURCES