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

จาก Theory Wiki
ไปยังการนำทาง ไปยังการค้นหา
(Ait-aa ถูกเปลี่ยนชื่อเป็น Ait-aa-2013)
 
(ไม่แสดง 4 รุ่นระหว่างกลางโดยผู้ใช้คนเดียวกัน)
แถว 5: แถว 5:
 
** Chapter 3: exercise 3.1-1, problems 3-4
 
** Chapter 3: exercise 3.1-1, problems 3-4
 
** Chapter 4: problems 4-1, 4-5
 
** Chapter 4: problems 4-1, 4-5
** Chapter 5: execises 5.2-4, 5.2-5
+
** Chapter 5: exercises 5.2-4, 5.2-5
 
** Chapter 8: exercises 8.1-2, 8.3-4
 
** Chapter 8: exercises 8.1-2, 8.3-4
 
* '''Homework 2''' from CLRS:
 
* '''Homework 2''' from CLRS:
 
** Chapter 5: problems 5-1, 5-2
 
** Chapter 5: problems 5-1, 5-2
 
** Chapter 15: exercise 15.4-5, problems 15-1, 15-4, 15-6
 
** Chapter 15: exercise 15.4-5, problems 15-1, 15-4, 15-6
 +
* '''Homework 3''' from CLRS:
 +
** Chapter 34: exercise 34.5-1, problems 34-1, 34-2
 +
** Chapter 22: problem 22-1 '''or''' 22-3
 +
** Chapter 24: exercise 24.3-6
  
 
== Schedules ==
 
== Schedules ==
แถว 36: แถว 40:
  
 
* Week10: Fibonacci heaps, van Em Bose trees
 
* Week10: Fibonacci heaps, van Em Bose trees
* Week11: TBA
 
  
* Week12: Computational geometry
+
* Midterm II
  
* Week13: NP-completeness I
+
* Week11: NP-completeness I
  
* Week14: NP-completeness II
+
* Week12: NP-completeness II, Graph algorithms I
  
* Week15: Approximation algorithms
+
* Week13: Graph algorithms II
 +
 
 +
* Week14: Computational geometry

รุ่นแก้ไขปัจจุบันเมื่อ 01:46, 6 มกราคม 2557

This is a home page for CS304 Advanced Algorithms.

Homework

  • Homework 1 from CLRS: (due 12 Feb 2013)
    • Chapter 3: exercise 3.1-1, problems 3-4
    • Chapter 4: problems 4-1, 4-5
    • Chapter 5: exercises 5.2-4, 5.2-5
    • Chapter 8: exercises 8.1-2, 8.3-4
  • Homework 2 from CLRS:
    • Chapter 5: problems 5-1, 5-2
    • Chapter 15: exercise 15.4-5, problems 15-1, 15-4, 15-6
  • Homework 3 from CLRS:
    • Chapter 34: exercise 34.5-1, problems 34-1, 34-2
    • Chapter 22: problem 22-1 or 22-3
    • Chapter 24: exercise 24.3-6

Schedules

This is tentative. The actual course schedule will be updated along the way.

  • Week1: Introduction, Growth functions, Recurrences and divide-and-conquer (CLRS Chapter 2; Section 4.1)
  • Week2: Medians and order statistics, Sorting in linear time (CLRS Section (4.2), 4.3, 4.4, 4.5; Section 9.3, Section 8.1, 8.2, 8.3)
  • Week3: Probabilistic analysis (CLRS Chapter 5, Section 7.3; see Appendix C for reviews on probability theory)
  • Week4: Probabilistic analysis (cont.) / Dynamic programming I
  • Week5: Dynamic programming II
  • Week6: Greedy algorithms (CLRS Sections 16.1, 16.2, 16.3), Minimum spanning trees
  • Midterm I
  • Week7: Hash tables, B-trees
  • Week8: Amortized analysis, scapegoat trees (see notes 15 from [1])
  • Week9: Data structures for disjoint sets, binomial heaps
  • Week10: Fibonacci heaps, van Em Bose trees
  • Midterm II
  • Week11: NP-completeness I
  • Week12: NP-completeness II, Graph algorithms I
  • Week13: Graph algorithms II
  • Week14: Computational geometry