Monday and Wednesday 9:30-10:45
60 Fifth Ave. room 150
Professor Ernest Davis
- phone: (212) 998-3123
- Office: 329 Warren Weaver Hall
- Office hours: Tuesday 10-12, Wednesday 3-4, or by appointment.
Recitation and Tutoring
The recitation section is section 002 of this course: CSCI-UA.0102-002.
It will meet Friday, 2:00-3:15, in the same room. The recitation
instructor is Yi-Hsiang (Joe) Kao.
Be sure to register
for this section in addition to 001.
Yi-Hsiang will hold office hours Wednesdays 2-3 in Warren Weaver Hall, room
Tutoring starts the second week of classes, Sept. 11.
Prerequisites: CSCI-UA 0101, Introduction to Computer Science
Data Structures and Algorithms in Java, Goodrich, Tamassia,
- Object oriented features in Java
- Abstract methods, interfaces, and generics
- Worst case asymptotic running time analysis
- Abstract Data Types
- Linked lists.
- FIFO Queues
- Hashing and hash tables
- Priority Queues
Weekly homeworks (10%)
Programming assignments (30%)
Two midterm exams (30%)
Final exam (30%)
All assignments should be uploaded to the NYU Classes site.
Homeworks should be either be in a plain-text file or
typeset in PDF or Word. Handwritten homeworks, or homeworks that are
handwritten and then scanned will not be accepted. You should include
your name on the homework itself and as a comment at the top of the programming
Due date and late policy: Homeworks and programming assignments
are due at the beginning of class the
day they are due. They will be accepted up to 1 week late with a penalty of 1 point out of 10. They will not be accepted later than that, because the
solutions will be posted.
Grading of Programming Assignments
In general, the programming assignments will be graded on the following basis:
Individual assignments may specify further, or different, grading criteria.
- Compiling, running correctly on the specified examples,
and following the specifications: 60%.
Zero credit will be given for a submission that does not compile; does
not give the correct answer for the example specified in the assignment;
or does not follow the assignment specifications (e.g. you submit an
iterative program for an assignment that specifies a recursive program.)
- Running correctly on the grader's test examples: 25%.
- Well-structured, well-written, commented code: 15%.
Additional help with Java, by Fred Swartz.
Sample Problems on Dynamic Data Structures
Class email list
You should be automatically subscribed to
the class email web page.
The first mid-term exam will be Wednesday Oct. 4.
Notes for First Midterm
Sample of First Midterm
The second mid-term exam will be Wednesday Nov. 15
Notes for Second Midterm
Sample of Second Midterm
The final exam is scheduled for Monday, December 18 in room 150, 60 FA
from 8:00 AM to 9:50 AM.
Notes on Final Exam
Sample Problems from the Third Part of the Course
Solutions to Sample Problems
Students with Disabilities
Academic accommodations are available for students with disabilities.
Please contact the Moses Center for Students with Disabilities (212-998-4980
or firstname.lastname@example.org) for further information. Students who are requesting
academic accommodations are advised to reach out to the Moses Center
as early as possible in the semester for assistance.
You may discuss any of the assignments with your classmates (or anyone else)
but all work for all assignments must be
entirely your own. Any sharing or copying of assignments will be
considered cheating. By the rules of the College of Arts and Science,
I am required to report any incidents of cheating to the department.
My policy is that the first incident of cheating will result in the
student getting a grade of F for the course.
The second incident, by CAS rules, will result in a one-semester suspension
from the College.