CSCI 302 Syllabus (tentative)

• Week 1
  • Mon: Course Intro; Running Times (Chs 1, 2, 3)
  • Wed: Insertion Sort, Orders of Growth (Chs 1, 2, 3)
  • Fri:  Divide & Conquer: Binary Search, Mergesort, Strassen's Algorithm (Chs 4, 28.2)
  
  
• Week 2
  • Mon: Recurrences, Quicksort, and The Master Theorem (Chs 4, 7)
  • Wed: Finding the Median, Selection (Ch 9) Problem Set 1 Due
  • Fri:  Carnival (no class)
    
  
  
• Week 3    
  • Mon: Heapsort, Priority Queues (Ch 6)
    
  • Wed: Lower Bounds for Sorting (Ch 8)
  • Fri:  Data Structures Survey (Ch 10) Problem Set 2 Due
  
  
• Week 4     
  • Mon: Hashing, Collision Resolution (Chs 10, 11) 
    
  • Wed: BSTs (Ch 12)
    
  • Fri: Skip Lists, Balancing Trees (Ch 13)  Problem Set 3 Due
  
  
• Week 5
  • Mon: Red-Black Trees (Ch 13)
  • Wed: Dynamic Programming, Fibonacci Numbers (Ch 15)
  • Fri:  Dynamic Programming and Graphs (Ch 15) Problem Set 4 (Part A) Due
    
  
  

• Week 6  
  • Mon: Greedy Algorithms, Huffman Encoding (Ch 16)  
  • Wed: Greedy Algorithms and Graphs (Chs 22, 23, 24)
  • Fri: Greedy Algorithms and Graphs (Chs 22, 23, 24)  Problem Set 4 (Part B) Due
  
  

  Spring Break - No Classes    
   

• Week 7
  • Mon: Matrix Algorithms (Ch 28)
  • Wed: Matrix Algorithms (Ch 28)  
  • Fri:    Exam (in class)
  
  
• Week 8
  • Mon: Matrix Algorithms (Ch 28)  
  • Wed: Linear Programming (Ch 29)  Problem Set 5 Due
  • Fri: Transforming the Domain, FFT (Ch 30)
  
  
• Week 9
  • Mon: Polynomials, FFT (Ch 30)
  • Wed: Number Theory (Ch 31) 
  • Fri: Number Theory (Ch 31)  Problem Set 6 Due
  
  
• Week 10
  • Mon: Number Theory (Ch 31) 
  • Wed: String Matching (Ch 32) 
  • Fri: Complexity, NP-completeness (Ch 34)
    
  
  
• Week 11
  • Mon: Complexity, NP-completeness (Ch 34)  Problem Set 7 Due
  • Wed: Complexity, NP-completeness (Ch 34)
  • Fri: NP-completeness (Ch 34)
  
  
• Week 12
  • Mon: Parallel Algorithms
  • Wed: Parallel Algorithms
  • Fri: Course Conclusion  Problem Set 8 Due