CSU 690
Algorithms and Data

Spring 2008

Instructor

Betty Salzberg

Hours

Lecture: MWTh 9:15-10:20 am 31 SL

Instructor's Office Hours: Wed noon to 1 and Thurs 1 to 2 and by appointment.

Office: 346 WVH
Phone: 2229
Email: salzberg@ccs.neu.edu

Final Exam date: April 17, (thursday) at 1pm

Grader

Priyank Shah
shah.pri@neu.edu

Java applet links to algorithm demos applets link thanks Saurabh!

Preliminaries---Username

I will use your nu email address for a mailing list. If you prefer some other email address, let me know.

Course Description

This course provides an undergraduate-level introduction to the design and analysis of algorithms. Topics covered may include the following.

Prerequisites

The following courses are prerequisites: CSU200, CSU213, MTHU481. By topic, the prerequisites are: Although there will be some review at the beginning of the course, the prerequisites will be strictly enforced. If you have not taken any of the prerequisite courses (or their equivalents), then you should not take CSU690.

Text

Required: Dasgupta, Papadimitriou and Vazirani: Algorithms McGraw Hill 2008

Recommended: T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, MIT Press & McGraw-Hill, Second Edition 2001.

Schedule

Until homework assignments are ready, links are to this page.

January 7, 9, 10 Chapter 0 Introduction
January 14,16,17,23,24 Chapter 1 Modular arithmetic and Cryptography First homework due Monday January 28 in class.
January 28, 30, 31, Feb 4, 6 Chapter 2 Divide and Conquer sections 2.1 to 2.4 Second homework due Monday February 11 in class.
Feb 7,11, 13,14,20, 21 chapter 3 graphs
Feb 25, 27 review review
Thursday Feb 28 midterm. midterm covers material so far
first sample quiz (A different textbook was used)
second sample quiz (a different textbook was used)
more sample quiz problems
still more sample quiz problems
March 10, 12, 13, 17 Chapter 4 more on graphs third homework due Monday March 17 in class.
March 19, 20, 24, 26, 27 chapter 5 greedy algorithms fourth homework due Monday April 7 in class.
March 31, April 2,3,7, 9,10 chapter 6 dynamic programming
April 14, 16 review review
Final exam week starts Thurs April 17 Final Exam comprehensive comprehesive

Homework Requirements

Homework is not accepted after the first fifteen minutes of the class hour when it is due. There is no "late" homework. You may drop the lowest score in the four assignments, so if you miss one, that will just be dropped. Any homework turned in that looks sloppy will not be accepted. You must use flat 8 1/2 by 11 paper and write or type neatly. Do not turn in papers written at the last minute and torn out of a notebook. Respect your own work.

Pop Quizzes

There will be an indeterminate number of pop quizzes. You may drop the two lowest scored pop quizzes. All pop quizzes will be given in the first fifteen minutes of class.

Grading

During the midterm and the final ONE PAGE (two-sided, 8.5X11 inches) of notes may be used. No textbooks or computers are allowed.

You must obtain at least a C average on the exams to obtain a C or above in the course. Also, failing grades on the in-class exams will mean a failing grade in the course, regardless of the homework.

POLICY ON I'S

If you have taken the midterm with a C average or better and done your homework with a C average after dropping one and taken the pop quizzes with a C or better average after dropping two and you have a written medical excuse for not taking the final exam, you may be eligible for an I. In this case, you must write a contract with the instructor spelling out how the incomplete will be resolved. After a year, an incomplete becomes an F.

Academic Honesty

Northeastern University is committed to the principles of intellectual honesty and integrity. All members of the Northeastern Community are expected to maintain complete honesty in all academic work, presenting only that which is their own work in tests and assignments. If you have any questions regarding the proper attribution of the work of others, contact your professor prior to submitting the work for evaluation.