Design of Algorithms 40-354 
  CE Department- Sharif University of Technology Fall 2014 - Group 1,2 

  Main Menu
   Home
   Syllabus
   Assignments
   Calendar
   Links
   Resources
   Piazza

Calendar

 Date   Topic  Comments
  1393/06/30     Introduction: Analysis of Algorithms, Fibonacci Numbers   Ref: BB [Ch1]
  1393/07/01     Largest Consecutive Subsequence, 3-SUM   Ref: CLRS [§4.1]
  1393/07/06     Design by Induction: Polynomials, Celebrity, Mapping, Min/Max   Ref: M [Ch5]
  1393/07/08     Divide and Conquer: Powering, Fibonacci, Closest Pair   Ref: CLRS [Ch4, §33.4]
  1393/07/15     Integer Multiplication, Strassen's Algorithm   Ref: KT [§5.5], CLRS [§4.2]
  1393/07/20     Dynamic Programming: Coin Changing   Ref: CLRS [§15.1,3]
  1393/07/22     Matrix-Chain Multiplication, LCS   Ref: CLRS [§15.2,4]
  1393/07/27     LIS, Edit Distance, Max Independent Set in Trees   Ref: M [§6.11], KT [§6.5]
  1393/07/29     Greedy Algorithms: Activity Selection, Knapsack   Ref: CLRS [§16.1-2]
  1393/08/04     Stable Marriage   Ref: KT [§1.1]
  1393/08/06     Data Compression, Huffman Coding   Ref: CLRS [§16.3]
  1393/08/11     Backtracking: Queens, Subset Sum   Ref: BB [§6.6]
  1393/08/18     Branch and Bound: Graph Coloring, TSP, Game Trees   Ref: BB [§6.6]
  1393/08/20     Graph Traversals: BFS and DFS   Ref: CLRS [§22.1-3]
  1393/08/25     Applications: Topological Sort, Connected Components   Ref: CLRS [§22.4-5]
  1393/08/27     Midterm   
  1393/09/02     Minimum Spanning Trees: Prim, Kruskal, and Reverse-Delete   Ref: CLRS [Ch23]
  1393/09/04     Single-Source Shortest Paths: Dijkstra and Bellman-Ford   Ref: CLRS [Ch24]
  1393/09/09     All-Pairs Shortest Paths: Floyd-Warshal and Johnson   Ref: CLRS [Ch25]
  1393/09/11     Maximum Flow and Minimum Cut: Ford-Fulkerson Algorithm   Ref: CLRS [§26.1-2]
  1393/09/16     Variations and Applications of Maximum Flow   Ref: CLRS [§26.3], KT [§7.5-7]
  1393/09/18     Polynomial-Time Reductions   Ref: KT [§8.1-2]
  1393/09/23     NP and NP-Completeness   Ref: KT [§8.3-4]
  1393/10/09     NP-Complete Problems   Ref: KT [§8.5,8]

 This website is visited 5195 times since September 2014. Updated Monday 2020-09-07 09:29