Where and When
Lectures: MWF 11:30-12:20 BAG 260
Instructor
Linda G. Shapiro, 214 Sieg Hall, 543-2196, shapiro@cs
Office hours: MWF 9:30-10:30 or by appointment
Teaching Assistants
Tian Sang sang@cs
Office hours: 226 Sieg Hall Tu 2:30-3:30 Th 2:30-3:30
Ian Simon iansimon2cs
Office hours: 226 Sieg Hall M 1:00-2:00 W 1:00-2:00
(The exact offices in the 226 suite will be posted soon)
Course Goals and Material to be covered
Please refer to the
Syllabus
Text
Mark Allen Weiss Data Structures and Algorithm Analysis in Java, 1999, Addison-Wesley. Errata.
The Java source code
for examples in the textbook is available.
If you prefer C++, an alternative is Data Structures and Algorithm Analysis in C++, also by Mark Allen Weiss. See the errata or example source code.
Assignments:
There will be a weekly assignment, either exercises or programming
"projects". Details on the format for the exercises
and turn-in for the projects will be given at the time of the
assignment.
For the assignments, algorithms should be written in pseudo-code (like in the lectures). Here is the pseudo-code manual.
For the programming projects, you can use the Math Sciences Computing Center (be sure to read the procedures on how to save your files on Dante etc...) or any other facility available to you. You are encouraged to program in Java but C++ programs will be accepted (without penalty).
Late assignments will not be accepted unless there is prior approval
Exams
Alas, there will be some: 1 midterm and 1 final.
Grading (this is still tentative but will most likely stand as is)
Posting of lectures and e-mail
Checking the CSE 373 Web home page frequently is required.
Lecture slides and the text of the Assignments will be posted on the Web.
Please subscribe to the CSE 373 mailing list (See instructions on the home page). A lot of communication between you, the TA's and the instructor can be done this way. The TA's and instructor will forward questions and answers to the whole class if appropriate.