Design of Algorithms 40-354 
  CE Department- Sharif University of Technology Fall 2012 - Group 1 

  Main Menu
   Home
   Syllabus
   Assignments
   Grades
   Calendar
   Links
   Resources
   Piazza

Calendar

 Date   Topic  Comments
  1391/06/26     Introduction: Fibonacci Numbers   Ref: BB [Ch1]
  1391/06/28     Largest Consecutive Subsequence, 3-SUM   Ref: CLRS [§4.1]
  1391/07/02     Design by Induction: Evaluating Polynomials, Celebrity, Min/Max, Lower Bounds   Ref: M [Ch5]
  1391/07/04     Randomized Algorithms: The Hiring Problem, Minimum Enclosing Circle   Ref: CLRS [Ch5]
  1391/07/09     Divide and Conquer: Skyline, Fibonacci, Closest Pair   Ref: CLRS [Ch4, §33.4]
  1391/07/11     Integer Multiplication, Strassen's Algorithm   Ref: KT [§5.5], CLRS [§4.2]
  1391/07/16     Sorting Networks: 0/1 Principle, Bitonic Sorter   Ref: CLRS 2e [Ch27]
  1391/07/18     Greedy Algorithms: Activity Selection   Ref: CLRS [§16.1-2]
  1391/07/23     Stable Marriage   Ref: KT [§1.1]
  1391/07/25     Huffman Coding   Ref: CLRS [§16.3]
  1391/07/30     Dynamic Programming: Binomial Coefficients, Coin Changing   Ref: CLRS [§15.1,3]
  1391/08/02     Matrix-Chain Multiplication, Knapsack (Fractional, 0/1)   Ref: CLRS [§15.2]
  1391/08/07     LCS, LIS, Edit Distance, Max Independent Set in Trees   Ref: CLRS [§15.4], KT [§6.6]
  1391/08/09     Backtracking: n-Queens, Subset Sum   Ref: BB [§6.6]
  1391/08/14     Branch and Bound: TSP, Game Trees, Alpha-Beta Pruning   Ref: BB [§6.6]
  1391/08/16     Graph Algorithms: BFS/DFS and Their Applications   Ref: CLRS [§22.1-3]
  1391/08/21     Topological Sort, Strongly Connected Components   Ref: CLRS [§22.4-5]
  1391/08/23     Midterm   
  1391/08/28     Minimum Spanning Trees: Prim, Kruskal, and Reverse-Delete   Ref: CLRS [Ch23]
  1391/08/30     Single-Source Shortest Paths: Dijkstra and Bellman-Ford   Ref: CLRS [Ch24]
  1391/09/07     All-Pairs Shortest Paths: Floyd-Warshal and Johnson   Ref: CLRS [Ch25]
  1391/09/12     Maximum Flow and Minimum Cut: Ford-Fulkerson Algorithm   Ref: CLRS [§26.1-2]
  1391/09/19     Applications of Maximum Flow   Ref: CLRS [§26.3], KT [§7.5-7]
  1391/09/21     Polynomial-Time Reductions   Ref: KT [§8.1-2]
  1391/09/26     NP-Completeness   Ref: KT [§8.3-4]
  1391/10/03     NP-Complete Problems: Sequencing and Numerical Problems   Ref: KT [§8.5,8]
  1391/10/05     Approximation Algorithms: Vertex Cover and TSP   Ref: CLRS [§35.1-2]

 This website is visited 9067 times since September 2012. Updated Thursday 1970-01-01 03:30