Best source of answers
Second best source of answers
Publisher's website for Object-Oriented
Data Structures Using Java
Joanna's office hours: Tuesday 9:30 - 11:00 AM, Thursday: 10:30 - 12:00. Room 328WWH.
Recitation 12 (week of Dec. 9)
CS Dept. final exam schedule
OpenDSA: Open Source Interactive Data Structures and Algorithms
AVL Trees and the
from the course notes.
Recitation 11 (week of Dec. 2)
Fill out online course evaluations!
Assignment 6 - Graphs
Come with questions (email them to me ahead of time if possible). For Eric's section this is the last recitation!
Recitation 10 (week of Nov. 25)
Assignment 6 - Graphs initial discussion.
Enjoy your Thanksgiving break!
Assignment 3 solutions + test + broken implementations.
Recitation 9 (week of Nov. 18)
Assignment 5 discussion.
Recitation 8 (week of Nov. 11)
CS Dept. final exam schedule
Recitation 7 (week of Nov. 4)
Assignment_4.pdf as of Oct. 30.
We will discuss the assignment and I will try to answer any questions you have.
createTreeManually sample code
Recitation 6 (week of Oct.28)
BACKUP YOUR DATA!!!
Assignment 2 solutions and tests:
How to use Iterator? tutorial.
BST.zip - binary search tree implementation with iterators (from Liang, "Intoduction to Java
Programming", chapter 27)
Huffman Coding animation
Recitation 5 (weeks of Oct.14 and Oct.21)
Writing hash functions: hashing.zip
Bitwise and Bitshift Operators
Assignment_3.pdf as of Oct. 19.
Assingment 1 solutions: SortedSetNode.java
Broken Examples that were used to test your test cases.
Test Cases that were used to test your implementation.
If your debugging techniques are limited to using System.out.print() statements, then you are not using
the tools available in Eclipse. Make sure that you know how to use the debugger - it will save you a lot of time
when writing code.
Academic Email Etiquette:
- Check the school email address on a regular basis. You can simply forward its content
to another email account that you use regularly.
- Use your school's email account to send emails to professors, instructors, TA's, graders,
administrators, etc. OR make sure that your email address contains your true name,
not "email@example.com", "BabyGurl@yahoo.com" or some other cool alias.
- Start your email with proper salutations! Use the correct titles (Professor, Dr., etc.)
and spell first and last names correctly. If you are on the first name basis with your instructors,
use their names, not "Hey". For example: "Dear Professor Drummer" or "Dear Robert", not "Hey Bob".
- Sign your name under the body of your email, otherwise you expect people to read emails from anonymous.
- Do not write everything in upper-case letters. Do not write everything in lower-case letters.
- Make sure you included everything you wanted before hitting send. Don't send three emails
one after another because you forgot something in the first one.
- Proofread the text in your email before sending it. Most of the email clients check for
typos, but they cannot tell if your email makes much sense. Read it, before you send it.
New Office Hours: Tuesdays 9:30 - 11:00, Thursdays 10:30 - 12:00, Room 328WWH.
Java documentation on docs.oracle.com
Command line on Windows:
Assignment submission protocol:
- Develop the code on your own machine or a lab machine. Make sure you compile and test things as you are working on the code.
- Use SFTP client to transfer all the code to the i5.nyu.edu machine (it does not matter which exact application for file transfer you use as long as the files get there).
- Login to i5.nyu.edu using ssh (again, it does not matter which ssh client you use).
- Comiple the code on the i5.nyu.edu machine. Repeat all your tests on that machine.
- If either the compilation or any of your tests fail, go back, fix the code and then repeat this step again.
- On your own machine or a lab machine, create a zip file with all your latest code (make sure that you update the code with any fixes/changes that you made after running the code on i5.nyu.edu).
- Upload the zip file to NYU Classes.
A few things you should know from before:
Testing = hacking the code
The following source code files contain an implementation of the linked list (unsorted list of doubles
that is implemented iteratively). You can easily write test cases to make the first version fail. The second version
solves some of the problems of the first version, but not all.
Office hours: Tuesday/Thursday 9:30 - 11:00 am
Contact me by email at firstname.lastname@example.org
Use course Forums on NYU Classes for any questions related to the course
material and assignment. Use email only for personal matters.
Notes on basics Eclipse/Java/Ocaml
installation and Linux/Unix command line use.
UPenn OcaIDE installation instructions.