Ait-aa-2014

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.
• Grading scheme: Midterm-1 25%, Midterm-2 25%, Final 30%, Homework 20%.

Homework

• Homework 1: (to start working in class on Friday 17th, due Friday, Feb 7th Friday 31st Friday 24th)
  • Ch.2: Problems 2-2, 2-3. (for 2nd Edition book: same problems.)
  • Ch.3: Exercises 3.1-1, 3.1-2; Problems 3-1a, 3-1b, 3-2, 3-4. (for 2nd Edition book: same problems.)
• Homework 2: (announced Jan 30th, due Feb 14th)
  • Ch.4: Exercises 4.4-1, 4.4-2, 4.4-9; Problems 4-1(a,b,d), 4-3(e,f,j), 4-5. (for 2nd Edition book: Exercises 4.2-1, 4.2-5; Problems 4-1(a,b,d), 4-4(e,f,j), 4-6; no equivalent problem for exercises 4.4-2)

Course materials

• Week 1: Introduction, insertion sort, asymptotic notations
  • YouTube:
    • Merge procedure: Part 1, Part 2, Part 3
    • Examples for O-notation: Full

• Week 2: Divide and conquer, recurrences
  • YouTube: Analysis of merge sort: Part 1, Part 2

• Week 3: Divide and conquer, continue
  • YouTube:
    • Integer Multiplication: Part 1, Part 2
    • Solving recurrences with the recursion-tree method: Full

• Week 4: Probabilistic analysis
  • YouTube: Probability Theory Review part 1, part 2

Links

• Last year course