ผลต่างระหว่างรุ่นของ "Ait-aa-2014"
ไปยังการนำทาง
ไปยังการค้นหา
Jittat (คุย | มีส่วนร่วม) |
Jittat (คุย | มีส่วนร่วม) |
||
| แถว 3: | แถว 3: | ||
== Announcements == | == Announcements == | ||
* Homework 1 is announced. You should work on this in class during the 1st hour of Jan 17th's class. It is due on Feb 7th. <del>Jan 24th.</del> | * Homework 1 is announced. You should work on this in class during the 1st hour of Jan 17th's class. It is due on Feb 7th. <del>Jan 24th.</del> | ||
| + | |||
| + | == Homework == | ||
| + | * Homework 1: (to start working in class on Friday 17th, due Friday, Feb 7th <del>Friday 31st</del> <del>Friday 24th</del>) | ||
| + | ** Ch.2: Problems 2-2, 2-3 | ||
| + | ** Ch.3: Exercises 3.1-1, 3.1-2; Problems 3-1a, 3-1b, 3-2, 3-4 | ||
| + | * Homework 2: | ||
== Course materials == | == Course materials == | ||
| แถว 11: | แถว 17: | ||
*** Examples for O-notation: [http://www.youtube.com/watch?v=2jERkhCh7Oc Full] | *** Examples for O-notation: [http://www.youtube.com/watch?v=2jERkhCh7Oc Full] | ||
*** Analysis of merge sort: [http://www.youtube.com/watch?v=UItoCEzvAe4 Part 1], [Part 2] | *** Analysis of merge sort: [http://www.youtube.com/watch?v=UItoCEzvAe4 Part 1], [Part 2] | ||
| − | |||
| − | |||
| − | |||
* Week 2: Divide and conquer, recurrences | * Week 2: Divide and conquer, recurrences | ||
รุ่นแก้ไขเมื่อ 01:39, 30 มกราคม 2557
This is a homepage for CS304 Advanced Algorithms.
Announcements
- Homework 1 is announced. You should work on this in class during the 1st hour of Jan 17th's class. It is due on Feb 7th.
Jan 24th.
Homework
- Homework 1: (to start working in class on Friday 17th, due Friday, Feb 7th
Friday 31stFriday 24th)- Ch.2: Problems 2-2, 2-3
- Ch.3: Exercises 3.1-1, 3.1-2; Problems 3-1a, 3-1b, 3-2, 3-4
- Homework 2:
Course materials
- Week 1: Introduction, insertion sort, asymptotic notations
- Week 2: Divide and conquer, recurrences
