CS 460
, Spring, 2010
Syllabus

This syllabus presents the weekly topics and assignments. The details of the syllabus and adjustments will be filled in as the course proceeds.

The assignments are due on the day they are listed and the quizzes should be done online before the class for which they are listed. Quizzes are on Blackboard.

The text is Algorithm Design by Kleinberg and Tardos. Unless otherwise noted, readings refer to this text

Other readings will be given as handouts or links to web pages.      Link to Blackboard

Course Schedule

date                topic                                   reading                                       assignment/quiz


Jan    18         Get syllabus
         20         Example algorithms               Ch 1


         25        Review Complexity               Ch 2,                     
         25        Lab 1        
         27        Graphs                                  Ch 3, 3.1-3.4


Feb     1        Graphs                                  Ch 3
           1        Lab 2
           3        Greedy Algorithms                 Ch 4, 4.1-4.3


           8         Shortest path, spanning tree    Ch 4, 4.4-4.7
           8         Lab 3
         10         Huffman code, solved ex.       Ch 4, 4.8


         15         No Class                      
         17         Huffman code
         17         Lab 4  


         22        Recurrence problems                        Ch 5, 5.1- 5.2
         22        No new lab -- complete previous labs!!
         24        Counting Inversions, Closest Points   Ch 5, 5.3- 5.4


Mar    1         Divide & Conquer, examples    Ch 5, Solved Exercises
          1         Lab 5                 
          3         Dynamic Programming            Ch 6, 6.1-6.2


          8          Dynamic Programming             Ch 6, 6.3-6.4        
          8          Lab 6
        10         Exam 1


        15           Spring Break
        17           Spring Break


        22           No Class
        24           RNA and Sequence Alignment     Ch 6, 6.5-6.8       
        24           Lab 6
        


       29          Network Flow                            Ch. 7, 7.1- 7.3
       29          Complete Lab 6
       31          Bipartite Matching                       Ch. 7, 7.5,


April  5        Circulations with demands, lower bounds
                               Survey Design, Airline Scheduling     Ch. 7,   7.7-7.9
         5          Lab 7       
         7         Image Segmentation, Project Selection Ch. 7, 7.10-7.11         final project assignment


       12         Polynomial reductions, SAT and 3-SAT        Ch 8, 8.1-8.3
       12         Complete Lab 7      
       14         NP and NP-complete problems                    Ch 8, 8.3-8.6


       19         NP-complete problems                                Ch 8, 8.4-8.8
       10         Lab 8         
       21         Co-NP and PSpace                                     Ch 8, .9=8.10, Ch 9, 9.1-9.2


       26         Overview of approaches to "hard problems"       scan Ch 11., 1 2, 13
       26         Project work -- consultation with instructor         
       28         Final project presentations                             Projects due!!   


Final Exam -- No final!