ผลต่างระหว่างรุ่นของ "Ait-aa"

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
แถว 13: แถว 13:
 
*** Integer Multiplication: [http://www.youtube.com/watch?v=uIA4CXVWvXA Part 1], [http://www.youtube.com/watch?v=mbRyDOEDTdk Part 2]
 
*** Integer Multiplication: [http://www.youtube.com/watch?v=uIA4CXVWvXA Part 1], [http://www.youtube.com/watch?v=mbRyDOEDTdk Part 2]
 
*** Solving recurrences with the recursion-tree method: [http://www.youtube.com/watch?v=lYa4RtMpuMs Full]
 
*** Solving recurrences with the recursion-tree method: [http://www.youtube.com/watch?v=lYa4RtMpuMs Full]
 +
 +
* Week 2-1 (1/26 - 1.5 hours):  Integer multiplication. Solving recurrences. Master's theorem.  Balls and bins.
 +
 +
* Week 3-1 (2/2): Practice on divide and conquer (convex hull problem).  Review on probability theory.  The hiring problem.  The birthday problem.
 +
  
 
== Links ==
 
== Links ==
 
* Old home pages for [[ait-aa-2014|2014]] and [[ait-aa-2013|2013]]
 
* Old home pages for [[ait-aa-2014|2014]] and [[ait-aa-2013|2013]]

รุ่นแก้ไขเมื่อ 15:08, 3 กุมภาพันธ์ 2559

This is a homepage for CS304 Advanced Algorithms.

Course materials

  • Week 1-1 (1/19): Introduction, insertion sort, asymptotic notations
  • Week 1-2 (1/21): More on big-O and algorithm analysis. Divide and conquer (maximum subarray sum)
    • YouTube:
  • Week 2-1 (1/26 - 1.5 hours): Integer multiplication. Solving recurrences. Master's theorem. Balls and bins.
  • Week 3-1 (2/2): Practice on divide and conquer (convex hull problem). Review on probability theory. The hiring problem. The birthday problem.


Links