====== Contents ======



  * [[:courses/cs211/winter2012/journals/suraj/preface.txt|Preface]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter1.txt|Chapter 1: Introduction: Some Representative Problems]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter2.txt|Chapter 2: Basics of Algorithm Analysis]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter3.txt|Chapter 3: Graphs]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter4.txt|Chapter 4: Greedy Algorithms]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter5.txt|Chapter 5: Divide and Conquer]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter6.txt|Chapter 6: Dynamic Programming]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter7.txt|Chapter 7: Network Flow]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter8.txt|Chapter 8: NP and Computational Intractability]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter9.txt|Chapter 9: PSPACE: A Class of Problems beyond NP]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter10.txt|Chapter 10: Extending the Limits of Tractability]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter11.txt|Chapter 11: Approximation Algorithms]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter12.txt|Chapter 12: Local Search]]
  * [[:courses/cs211/winter2012/journals/suraj/chapter13.txt|Chapter 13: Randomized Algorithms]]