ผลต่างระหว่างรุ่นของ "Ait-aa-2013"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) (หน้าที่ถูกสร้างด้วย 'This is a home page for '''CS304 Advanced Algorithms'''. == Schedules == * Week1: Introduction, Growth functions, Recurrences and div...') |
Jittat (คุย | มีส่วนร่วม) |
||
| แถว 3: | แถว 3: | ||
== Schedules == | == Schedules == | ||
| − | * Week1: Introduction, Growth functions, Recurrences and divide-and-conquer | + | * Week1: Introduction, Growth functions, Recurrences and divide-and-conquer (CLRS Chapter 2; Section 4.1) |
| − | * Week2: Medians and order statistics, Sorting in linear time | + | * 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 | + | * Week3: Probabilistic analysis (CLRS Chapter 5) |
* Week4: Randomized algorithms | * Week4: Randomized algorithms | ||
รุ่นแก้ไขเมื่อ 16:20, 28 มกราคม 2556
This is a home page for CS304 Advanced Algorithms.
Schedules
- 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)
- Week4: Randomized algorithms
- Week5: Greedy algorithms I
- Week6: Greedy algorithms II
- Week7: Dynamic programming I
- Week8: Dynamic programming II
- Week9: Hash tables, B-trees
- Week10: Amortized analysis, Binomial heaps and Fibonacci heaps
- Week11: Minimum Spanning Trees, Data structures for disjoint sets
- Week12: Computational geometry
- Week13: NP-completeness I
- Week14: NP-completeness II
- Week15: Approximation algorithms
