Basic Algorithms

Chapter 0: Administrivia

I start at 0 so that when we get to chapter 1, the numbering will agree with the text.

0.1: Contact Information

• gottlieb@nyu.edu (best method)
• http://allan.ultra.nyu.edu/~gottlieb two el's in allan
• 715 Broadway, Room 712

0.2: Course Web Page

There is a web site for the course. You can find it from my home page, which is http://allan.ultra.nyu.edu/~gottlieb

• You can find these lecture notes on the course home page. Please let me know if you can't find it.
• I mirror my home page on the CS web site.
• I also mirror the course pages on the CS web site.
• But, the official site is allan.ultra.nyu.edu. It is the one I personally manage.
• The notes will be updated as bugs are found.
• I will also produce a separate page for each lecture after the lecture is given. These individual pages might not get updated as quickly as the large page

0.3: Textbook

The course text is Goodrich and Tamassia: ``Algorithm Design: Foundations, Analysis, and Internet Examples.

• Available in bookstore.
• I expect to cover nearly all of the first 7 chapters.

0.4: Computer Accounts and Mailman Mailing List

• You are entitled to a computer account, please get it asap.
• Sign up for the Mailman mailing list for the course. http://www.cs.nyu.edu/mailman/listinfo/v22_0310_002_fa02
• If you want to send mail just to me, use gottlieb@nyu.edu not the mailing list.
• Questions about the lectures or homeworks should go to the mailing list. You may answer questions posed on the list as well.
• I will respond to all questions; if another student has answered the question before I get to it, I will confirm if the answer given is correct.

0.5: Grades

The major components of the grade will be the midterm, the final, and homeworks. I will post (soon) the weights for each.

0.6: Midterm

We will have a midterm. As the time approaches we will vote in class for the exact date. Please do not schedule any trips during days when the class meets until the midterm date is scheduled.

0.7: Homeworks, Problem Sets, and Labs

If you had me for 202, you know that in systems courses I also assign labs. Basic algorithms is not a systems course; there are no labs. There are homeworks and problem sets, very few if any of these will require the computer. There is a distinction between homeworks and problem sets.

Problem sets are

• Required.
• Due several lectures later (date given on assignment).
• Graded and form part of your final grade.
• Penalized for lateness.

• Optional.
• Due the beginning of Next lecture.
• Not accepted late.
• Mostly from the book.
• Collected and returned.
• Able to help, but not hurt, your grade.

0.8: Recitation

There is a recitation session on tuesdays from 9:30 to 10:45 in room 109. The recitation leader is Sean McLaughlin <seanmcl@cs.nyu.edu>.

0.9: Obtaining Help

Good methods for obtaining help include

1. Asking me during office hours (see web page for my hours).
2. Asking the mailing list.
3. Asking another student, but ...
   Your homeworks must be your own.

0.10: The Upper Left Board

I use the upper left board for homework assignments and announcements. I should never erase that board. Viewed as a file it is group readable (the group is those in the room), appendable by just me, and (re-)writable by no one. If you see me start to erase an announcement, let me know.

0.11: A Grade of ``Incomplete''

It is university policy that a student's request for an incomplete be granted only in exceptional circumstances and only if applied for in advance. Naturally, the application must be before the final exam.