CIS 5515 - Design and Analysis of Algorithms

Course Outline

Slides
                  
          Chapter 1 Introduction: Samples [Lecture 1]
                  
          Chapter 2 Algorithm Analysis
                  
          Chapter 3 Graphs [Lecture 2]
                  
          Chapter 4 Greedy Algorithms [Lecture 3]
                  
          Chapter 5 Divide and Conquer[Lecture 4a, 4b, 5]
                  
          Chapter 6 Dynamic Programming [Lecture 6, 7]
                  
          Chapter 7 Network Flow, Applications, and Demo [Lecture 8, 9]
                  
          Chapter 8 Reductions [Lecture 10]
                  
          Chapter 9 P, NP, and PSPACE [Lecture 11]
                  
          Chapter 11 Approximation and Demo [Lecture 12]
                  
          Additional topic: Adversary Arguments and Supplement One, Two, Three, and Four [Lecture 13]
         
Homework
                  
          HW1
                  
          HW2
                  
          HW3
                  
          HW4
                  
          HW5
                  
          HW6
         
Examination
                  
          Midterm
                  
          Final