Data Structures (Honors section)

V22.0102.001
Monday-Wednesdays 11:00:- 12:15
Room 101, Warren Weaver Hall
Professor Edmond Schonberg

Reaching Me


e-tutor

The e-tutor for the course is Akshay Arora ( aa316@is8.nyu.edu ). He is available for general questions about data structures, about using the system, and about the assignments (but he will not debug your programs :-)). All programming assignments should be sent both to him and to me.

Class list

All students should register themselves with the class list, which is used for all technical discussions concerning the course and the course project. To register, send an e-mail message to majordomo@cs.nyu.edu. The contents of the message should be the single line:
     subscribe v22_0102_001_sp00

Required Textbook

Sartaj Sahni : Data Structures, Algorithms, and Applications in Java (McGraw-Hill, 1999)

Outline.

The course will use Java to describe algorithms and data structures, and the assignments will be done in Java. I assume that you are confortable with programming in Java, and that the first chapter of the book contain familiar material (you will want to review it briefly to make sure, skipping the material on exceptions for now). Data structures is all about abstractions, which are useful in any programming language, so if you want to write the assignments in other programming languages as well, let me know! We will cover chapters 2, 3, 4, 5-10, 12, 17 of the text, and special material if time permits.

Coursework

There will be several programming assignments, a midterm examination, and a final examination. Each of there components represents roughly one third of the final grade. There will be a few short quizzes to make sure everyone is keeping up with the material.

Assignments

Assignment I
Assignment II
Assignment III
Assignment IV