Gerry Howser
Missouri University of Science and Technology


CS 253A Algorithms, Analysis and Design

Topics Weeks Date
Ch.1: Algorithms: Algorithms, Complexity, Efficiency 0.5 weeks 8/26
Ch. 2: Basic Algorithm Design and Analysis:
  2.1 Simple Algorithms & Invariants,
  2.2 Run-time analysis, 2 weeks
  2.3 Some algorithm design basics: the Divide and Conquer approach
2 weeks 8/26
Ch. 3: Asymptotic Analysis:
  3.1 Theta, big-Oh,
  3.2 Common Functions and tricks
     Apendix A. Math Techniques
1 weeks TBA
Exam I 1 class Sept 18
Ch. 4: Recurrences: 1.5 weeks TBA
Ch. 6: Heapsort revisited: 1.5 weeks 9/27 - 10/4
Exam II 1 class October 25
Ch. 15: Dynamic Programming: 2.5 weeks TBA
Ch. 16: Greedy Algorithms: 2.5 weeks TBA
Ch. 22: Graph Algorithms:
    Apendix B: Graph Theory for Computer Scientists
  22.1 Representations of Graphs
  22.2 Breadth First Search, correctness and complexity
  22.4 Depth First Search and Topological Sort
  22.5 Strongly Connected Components
1.5 week TBA
Ch. 23,24,25: Spanning Tree and Shortest Path Algorithms 1.5 weeks TBA
Ch. 26: Maximamum Flow: 1.5 weeks TBA
Exam III 1 class TBA
Ch. 34: Brief Introduction to NP Completeness and Undecidability: 0.5 weeks TBA

Updated: September 18, 2013