CS 325: Analysis of Algorithms (Fall 2016)
Amir Nayyeri (Office hours: Wed 2-3pm at KEC 3061)
Hung Le (Office hours: Tue 5-6pm at KEC Atrium), Zhicheng Fu (Office hours: Thr 2-3pm at KEC Atrium)
Lectures: Tue, Thr 10:00am-11:20am in ILLC 155
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.
- 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%):
Final exam solutions.
Delayed GA4 submissions receive no penalty, if submitted before Mon.
However, I recommend submitting GA4 as soon as possible and focusing on preparation for the final exam.
Amir holds extra office hours on Fri, Dec 2, 3-4pm.
Final: Mon, Dec 5 (6:00pm), at ILLC 155.
There is no office hours on Wed, Nov 23.
Amir holds extra office hours on Mon, Oct 31, 2-3pm.
Amir holds extra office hours on Mon, Oct 24, 2-3pm.
Sample input/outputs for GA2 are corrected.
Midterm: Tue, Nov 1, in class.