Honors Basic Algorithms: ALL Announcements
Tuesday, Dec 5, 2000.

I will set up a final exam homepage shortly. It will
be under the hw subdirectory.
NOTE that the final exam period is slightly longer
than our regular class period! It is from 10:00 to 12:00.
PLEASE check your own final exam
schedules to se that that is NO conflict between with
our exam. If so, you must contact me immediately.

The last homework (hw7) is now available. Please note
the strict deadline (4:30pm, Tuesday Dec 12).
Reason: we want to grade them and
return them to you by Wednesday Dec 13.

The last class will be Tuesday, Dec 12 (recitation).
THERE IS NO CLASS on Wednesday Dec 13!
Tuesday, Nov 21, 2000.

The second midterm is next Monday. Please go
the midterm page on the web for details.
This is the same link as for the first midterm.

As announced in class today, next Tuesday's recitation
will be cancelled as I will be out of town.

If you have not yet done so, please pick up
your graded hw6 in class tomorrow. The solution
is posted on the web.
Thursday, Nov 9, 2000.

As announced in class, we will have the second midterm exam
during class on Monday, November 27 (not Nov 22).
For this exam, you are allowed 2 sheets of notes (of course,
one of the sheets can be the one you prepared for the first
midterm).

The 6th homework is now available, and it is important to
do them by next Friday (Nov 17).
IMPORTANT NOTE:
I must have your hw6 by 4:00pm in my office on Friday.
The reason is that we plan grade
them and return them by Nov 22 (before the
Thanksgiving break, and in time for the second midterm).

Lecture Notes on AVL trees are available in the class webpages.
Tuesday, October 17, 2000.
Monday, October 16, 2000.
 Graded hw3: this has been available since last Tuesday for
pickup. (Oops! I said "hw2" instead of "hw3" earlier.
Hw3 is the nonprogramming homework.)
 Homework 4: general amnesty, as we focus our attention
on the coming Midterm next Monday! Part 2 of hw4 (FVec Class)
will be due October 25 (after the midterm exam).
Those who already handed this in can resubmit if you wish.
 Homework 5: out today, due on Friday Oct 20
(just before midnite). We need to rush
this since we want to do some practice on material
to be covered by the midterm.
We cannot afford any late homeworks, as I will post the
solution by Saturday!!!
ON SUBMITTING hw5 by Friday: This is a written homework
(no programming). My preference is a hard copy of
your solution, slipped under my door. But since
this building (Warren Weaver Hall) shuts down
at 11pm, so you need to come in before then.
Alternatively: fax me at 9954124 (be sure to address
it to me, as there are other users at this fax).
 Tomorrow's class (Tue Oct 17) will be treated as a regular
lecture: we will continue to discuss hashing.
 In preparation for the midterm:
 bring your questions to class on Wed Oct 18!
 start preparing your "cheat sheet" (8"x11", 2sided)
for the midterm.
 I will post a "Reading List" for the midterm by
tomorrow. Mainly, to narrow down the sections
of the book you need to read for the midterm.
We will omit most of the Java stuff.
Very little Java (if any) will appear in the test.
 I will post a sample midterm from the past, as
a VERY rough indicator of how we pose questions.
October 11, 2000.
 New format for announcements: starting from this one,
we will put all the announcements in one list so that
it is more convenient to scroll down to the old ones.
 FINAL EXAM is confirmed to be Monday December 18
at 10:0011:50am. Room to be announced.
October 10, 2000.
 REMINDER: Midterm is Monday Oct 23, as announced in our class
schedule.
 Class Lunch: As we discussed in class, this will take place at the
NYU Torch Club on Waverley Place,
on a Wednesday during class time (11:00 to 12:15).
 We will make up the last class by lecturing during one
of the recitation periods.
 We decided to use Wed Oct 25 (first Wed after the
midterm). If you have problems with this date,
please let me know at once!
 The sponsors of this event would like you to know that our lunch
is sponsored by NYU's EQUAL (Enhance the Quality of UndergrAduate Life).
October 6, 2000.
 My lecture notes on FFT and Fast Integer Multiplication is
now available on the web (under Lectures).
 I have included some hints on how to organize the input for
your FFT algorithm. Look under hw4, hints.
 About the bug in lecture on Wednesday. Recall I tried to
work out the computation for the FFT algorithm in the case M=17,
U=V=3. The size of the FFT matrix is n=4. So we need a
primitive 4th root of unity. The mistake in lectures was that
we choose omega=2. But 2 is actually a primitive 8th root of
unity! You should choose omega=4 instead.
October 4, 2000.
 Hw 4 is published today, due in just over a week.
 Solution for hw3 is available on web.
 I applied for and received some "small event funds" from NYU.
I plan to have an lunch date for the class
at The Torch Club (NYU's faculty and alumni dining facility on
Waverly St). It is a general
gettoknowyourclassmates kind of thing (I promise not
to discuss DFT/FFT).
We need to agree on a date. I thought that a Tuesday
lunch would be great. Please send me your availability
(possible weeks and exact time).
 Coming up this week:
(1) Notes on recurrences
 (2) Notes on FFT and fast integer multiplication
September 11, 2000:
 I hope that by now, everyone in the class
is in the class mailing list.
 Also, you should be more familiar with the
organization of the class webpage.
Do let me know of any wrong information or
broken link in these pages.
 I have just added a link for "lectures". I cannot
promise that all lectures will appear there, or
in any state of completeness. Still, it might
be useful to some students.
September 6, 2000:
 Welcome back to NYU!
 We hope you look forward to learning about
algorithms and data structures, and their analysis. This is a
fundamental topic in computer science.
 Our textbook is
``Data Structures and Algorithms in Java''
(second Edition) by Goodrich and Tamassia, from John Wiley and Sons.
As you can see from the title, we will be using
Java as an additional vehicle to understanding this subject.
END OF ANNOUNCEMENTS