Analysis of Algorithms (CS 224)

The latest version of this hypertext document is available on the World Wide Web at http://www.cs.uvm.edu/~aarslan/teaching/cs224/spring04/home.html
The goal of this course is to introduce algorithm design methods such as greedy method, divide and conquer, dynamic programming, backtracking, and branch and bound. We will cover a variety of algorithmic problems from sorting to graph theoretical or combinatorial problems. In this course, we will also study correctness proofs, and complexity analyses of algorithms. We will also cover the definition of complexity class NP and basic NP-completeness results. We will also discuss several approximation algorithms for hard problems.
  • Spring 2003 (Enrollments: 25)
  • Time/Location/Computer number. Time/Location/Computer number. TR 5-6:15 pm / Torrey 203 / 10322.
  • Instructor. Abdullah Arslan (aarslan@emba.uvm.edu)
    • Office: Votey 317
    • Phone: 62538
    • Office hours: TR 3-4:30 pm
  • Teaching Assistant. Yoav Keren (ykeren@emba.uvm.edu) (Office  Hours: MW 2:30-4 pm, Votey 369)
  • Text book:  Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. Introduction to Algorithms.  Second Edition. The MIT Press. ISBN 0-262-03293-7.
  • Lecture Slides:  123 4567891011121314   15       16
  • Prerequisites. CS 103, 104, Math 173 recommended.
  • Grading
Assignments (Written or Programming)
  HW 1 ( Sol ) HW 2 ( Sol )   HW 3 ( Sol ) 
   HW 4  ( Sol )  HW 5  ( Sol )            
30 %
2 In-Class Exams: 
Exam 1 was on Thursday, March 11
Exam 2 was on Thursday, April 22
2 x 20 %
Final Exam  Monday, May 10, 8pm
30 %

·Assignments and exams may have additional questions directed only to graduate students.

·The letter grades to undergraduate students will be determined after the graduate students are assigned their letter grades.
 

Late assignments will not be accepted for credit, unless there are exceptional and documented medical or family problems.

  • Keeping Informed. All assignments, projects and changes to the course material will be announced on this web page. It is your responsibility to monitor it on a regular basis.
  • Academic Honesty. In regular assignments, you may discuss the problems to gain better understanding and more insight into the problems but the specifics related to work on which you are evaluated must be done by yourself. Plagiarism will not be tolerated.
  • Special needs. If you are entitled to extra accommodation for any reason (such as a disability), we will make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course.

Announcements

   Apr 20.  Solutions of HW 4 and HW 5 are posted.
   Apr 15.  HW 5 is posted.
  Apr 14.  Solution of HW 3 is posted.
  Apr 8.  HW4 is posted.
  Apr 1.  HW3 is posted.
  Mar 5.  Solution of HW 2 is posted.
  Feb 26.  HW 2 is posted. Exam 1 is scheduled to Thursday March 11.
  Feb 24.  Solution of HW 1 is posted.
 Feb 10.  In HW 1, part b of Question 5 is cancelled.
 Feb 5.  HW 1 is posted. It is due Thursday, Feb 12, in the class.

Last updated: May 8, 2004