COURSE ID: V22.0310.001, Honors Basic Algorithms, Fall 2000
COURSE LINKS: Please bookmark our Course Page.
You can also find this using links from the CS department page.
CLASS MAILING LIST: You must join the class mailing list immediately. Click here for instructions.
CLASSES: (1) Lecture: Mon and Wed, 11:00--12:15, in WWH 101
(2) Recitation: Tue, 9:30-10:45, in WWH 101
TEACHER: Chee Yap, Office: WWH 416,
Phone: (212)998-3115, Email:
OFFICE HOURS: Monday 10:00--11:00, and by appointment.
PREREQUISITE: A high level programming language (not necessarily Java)
Data structures course (V22.0102)
TEXTBOOK: Data Structures and Algorithms in Java (2nd Edition) by Goodrich and Tamassia, John-Wiley (2000)
EXAMS: Short Quizzes may be in class.
Midterm: Mon Oct 23, in class.
Final Exam: (CONFIRMED) Monday, Dec 18 at 10:00-11:50. Room WWH 101 (usual classroom).
HOMEWORK: No late homework. About 8 homeworks (including programming assignments).
We recommend that you have at two 3.5" high density diskettes, to backup two copies of your work at all times. You are responsible for keeping an extra copy of your submitted homework.
PROGRAMMING: Java language (no Java background assumed)
COURSE ACCOUNT: Unix is the official operating system. Although you may be able to do your programming without a unix account, we highly recommend that you apply for one.
GRADE: curved, 40% homework + quizzes, 20% midterm, 40% final.
ACADEMIC INTEGRITY: This must be taken seriously. All handed in assignments must represent your own work. If you use any programs or solutions from sources in the open literature, you should give full attribution. You should never copy work of other students, nor let your work be copied by others. However, we encourage you to discuss problems and material with other students in the class. But all writeup must be your own.


The course introduces you to

The pace is brisk; expect to spend time outside of lectures to keep up with the work. Attendence at lectures and recitations is an essential part of the course.