CS 325: Analysis of Algorithms (Fall 2017)
Instructor:
Amir Nayyeri (Office hours: Wed 34pm at KEC 3061)
TA:
Evgenia Chunikhina (Office hours: Fri 910am at KEC Atrium), Zhicheng Fu (Office hours: Mon 34pm at KEC Atrium)
Lectures: Tue, Thr 10:00am11:20am in KEAR 112
Tentative topic list: Asymptotic running time analysis, Recursion, Divide and conquer, Dynamic programming, Greedy algorithms, Linear programming, Computational complexity (P and NP), Randomization*, Approximation algorithms*.
Prerequisites: CS 261; Data structures and introductory discrete mathematics, trees and graphs, data structures such as priority queues, basic proof technique including induction.
Evaluation:
 Group Assignments (30%): You are encouraged to work on in groups of up to 3 students. You do not need to work in the same group for each assignment, but you will only get credit for an assignment if your name is listed on exactly one submission. Late assignments will not be accepted without prior arrangements.
 Practice Assignments (10%): These assignments must be completed individually, and submitted in class or slid under the door of my office on the due day before midnight. Late assignments will not be accepted without prior arrangements. These assignments will be graded on effort alone and will not be returned. Solutions will be posted.
 Midterm exam (30%)
 Final exam (30%):
Resources:
Announcements:

PA3 is posted.

GA3 is posted.

Midterm solutions are posted.

Amir will have extra office hours Mon 10/30, 45pm.

Amir will have extra office hours Mon 10/23, 45pm.

GA2 is posted.

Midterm will be on Oct 31.

Practice Assignment 2 is posted.

Amir will have extra office hours Mon 10/9, 45pm.

Test cases for GA1 are posted.

Group Assignment 1 is posted.

Practice Assignment 1 is posted.

First class, Thr, Sep 20.
Homework:
Lectures:
 Thr 9/21:
Course introduction, Asymptotic running time analysis.
 Tue 9/26:
Asymptotic running time analysis, also see these videos by Tim Roughgaden.
 Thr 9/28: (1) Recursion (Sections 1.1 to 1.3); Hanoi Tower, simplify and delegate.
 Tue 10/3: (1) Induction (Section 6); Tiling by triominos, Pancake Sorting.
(2) Divide and conquer. PA1 due.
 Thr 10/5: Divide and conquer; Binary search, Merge sort.
 Tue 10/10: Divide and conquer; Quick sort/select, Karastuba's multiplication. GA1 due.
 Thr 10/12: Dynamic programming; Introduction, number of binary strings with no '11' (Fibonacci numbers).
 Tue 10/17: (1) Maximum weight independent set on a path, (2) Dynamic programming; Longest increasing subsequence.
 Thr 10/19: Dynamic programming; Longest increasing subsequence, longest common subsequence.
 Tue 10/24: Dynamic programming; Longest common subsequence, Edit distance.
 Thr 10/26: Graphs.
 Tue 10/31: Midterm. Midterm of Fall 16. , Midterm solutions.
Grades: 32 32 31 30 30 29 29 28.5 28.25 27 27 26.5 26 26 26 26 25.5 25 25 25 24.5 24.5 24.5 24.5 24 23.25 23.25 23 23 23 22.5 22.5 22.5 22.5 22.5 21.5 21.5 21.25 21 21 21 20.5 20.5 20.5 20.25 20 20 19.5 19.5 19.5 19 18.75 18.5 18 18 17.75 17.5 17.25 17 17 17 17 17 17 17 16.75 16.5 16 16 16 16 15.75 15.5 15.5 14.5 14 13.5 13.5 13 12.5 12.25 12 12 11.5 11.25 11.25 10.5 10.5 10 9.75 9.5 9
 Thr 11/2: Minimum spanning trees, Boruvka.
 Tue 11/7: Minimum spanning trees, Generic MST, Boruvka, Kruskal.
 Thr 11/9: Minimum spanning trees, Prim, fast implementations.
 Tue 11/14: (1) Minimum spanning trees, Kruskal. (2) Greedy Algorithms. GA3 due.
 Thr 11/16: Greedy Algorithms.