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
                  
          Chapter 5 Divide and Conquer
                  
          Chapter 6 Dynamic Programming
                  
          Chapter 7 Network Flow, Applications, and Demo
                  
          Chapter 8 Reductions
                  
          Chapter 9 P, NP, and PSPACE
                  
          Chapter 11 Approximation and Demo
                  
          Additional topic: Adversary Arguments and Supplement One, Two, Three, and Four
         
Homework
                  
          Homework1
                  
          Homework2
                  
          Homework3
                  
          Homework4
                  
          Homework5
                  
          Homework6
         
Examination
                  
          Midterm
                  
          Final