Algorithms, Spring 2006  (Tentative Plan)


Classes: Tu-TH 10:55am-12:10pm.
Classroom: 112 MH (MACBRIDE  HALL)


Instructor: Suely Oliveira

Office Hours: M and Tu 10:00-11:00

Room: 101H, MLH                        

Phone: 335-0731                             


T.A: Greg Nichols

Office hours:  W 1:00-2:00 pm

Room:  101K

Phone:  353 - 2542


Book: Jon Kleinberg and Eva Trados,  Algorithms Designs, Addison Wesley, 2006

 (ISBN: 0-321-29535-8).  Book web site:


DESCRIPTION:  The emphasis of this course is the Design and Analysis algorithms. Topics include algorithm design techniques  divide and conquer, dynamic programming and greed approaches,  analysis techniques (big-0 notation, recurrence); sorting (merge sort, heapsort, and quicksort),  basic graph algorithms (depth-first and breadth-first search, minimum spanning trees, shortest paths); Introduction to NP-completeness and approximation algorithms. Applications will be emphasized.

PREREQUISITES:    Undergraduate standing, grade of C- or higher in 22C:021 and 22C:019 and 22M:021 or 22M:025 or 22M:031.

HOMEWORK POLICY: Assignments will normally be due one week after they are assigned and should be turned in and picked up in the classroom.  Homework will be usually due on TH and there will be a discussion in class before the due date about the homework (more details will be given in class).




Week (dates)




 Hws due dates

#1  01/17



 Chapter 1


#1  01/18


Basics of Analysis

 Chapter 2


#2  01/24


Basics of Analysis

 Chapter 2


#2  01/26



 Chapter 2


#3  01/31



 Chapter 3


#3  02/02



 Chapter 3


#4  02/07



 Chapter 4


#4  02/09


Greedy Algorithms

 Chapter 4


#5  02/14


Greedy Algorithms

 Chapter 4


#5  02/16


Greedy Algorithms

 Chapter 4

#6  02/21


Greedy Algorithms

 Chapter 4


#6  02/22


Greedy Algorithms

 Chapter 4


#7  02/28


Greedy Algorithms

 Chapter 4


#7  03/02


Divide and Conquer Programming

 Chapter 6


#8  03/07





#8  03/09






 Tentative Dates: Midterm  --  March 9th 2006.

 A similar table will be posted on ICON for the last 8 weeks of class.


GRADING:  everything is shown on ICON
(Use your HawkID and password to log in).

GENERAL POLICY: You should make every effort to attend all lectures.  Missed lecture notes should be obtained from fellow students.  Handouts and homework answer sheets can be obtained from the web page. It is the responsibility of the student to notify the instructor in advance if the student cannot attend a regularly scheduled exam. It is expected that students will conduct themselves in a courteous manner to the professor and fellow students.  That includes no cell-phone calls, minimal talking in class, and no other actions that are disruptive to the class.  Make every effort to arrive on time to class.


ATTENDANCE POLICY: Students are expected to attend most lecture sessions.  Failure to attend may affect you grade.  Students are responsible for material covered the days they miss.  Students are encouraged to actively participate in the class in a constructive manner.

We are asked to post some University Rules. Here they are :

Note 1:I need to hear from anyone who has a disability which may require some modification of seating, testing or other class requirements so that appropriate arrangements may be made. Please see me after class or during my office hours .


Note 2:This course is given by the College of Liberal Arts and Sciences. This means that class policies on matters such as requirements, grading, and sanctions for academic dishonesty are governed by the College of Liberal Arts and Sciences. Students wishing to add or drop this course after the official deadline must receive the approval of the Dean of the College of Liberal Arts and Sciences. Details of the University policy of cross enrollments may be found at:


Note3: Complaints should be initiated at the faculty or department level. The Department of Computer Science Departments has offices in 14 MLH