COURSE ID: V22.0310.001, Basic Algorithms, Spring 2001
COURSE LINKS: Please bookmark our Course Page.
You can also find this using links from the CS department page.
Our T.A. Deni Llambiri also has a webpage for the class.
CLASS MAILING LIST: You must join the class mailing list immediately. Easiest to use web interface at For non-web instructions, etc, please Click here.
CLASSES: (1) Lecture: Mon and Wed, 9:30--10:45, in WWH 109
(2) Recitation: Mon, 12:30-1:45, and Fri, 2:00--3:15. Both in WWH 101.
TEACHER: Chee Yap, Office: Warren Weaver Hall, Room 416,
Phone: (212)998-3115, Email:
TEACHING ASSISTANT: Deni Llambiri, (a TA's website will be forthcoming)
Warren Weaver Hall, Room 417, Phone: 998-3016
GRADER: Zilin Du. You should normally direct your questions (even about the grading) to the T.A., or to me, not to the grader.
OFFICE HOURS: Tuesday 3:00--4:00, and by appointment.
PREREQUISITE: A high level programming language (not necessarily Java)
Data structures course (V22.0102)
TEXTBOOK: Computer Algorithms: Introduction to Design and Analysis (3rd Edition) by Sara Baase and Allen Van Gelder Addison-Wesley (2000)
EXAMS: Possible short Quizzes in class or recitation.
Midterm: Wed Mar 7, in class.
Final Exam: May 2.
HOMEWORK: No late homework. About 8 homeworks (including programming assignments).
If a homework is to be handed in via email, then it is due at 12 midnite of the due date. Otherwise, it is due after lecture or after recitation.
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.