COT-6405: Analysis of Algorithms (Fall 2018)

Instructor: Ning Xie (office ECS 380)
Location: ECS 134
Time: Tuesday and Thursday 14:00 -- 15:15
    Office Hours: Tuesday 15:30 -- 17:30, or by appointments
TA: TBA



(Disclaimer: All information on this page about the course is tentative and subject to further changes.)

Syllabus:

• Asymptotics, Recurrence
• Divide-and-Conquer (Strassen, FFT)
• Advanced Data Structures
• Graphs & Graph Algorithms
• Dynamic Programming
• Greedy Algorithms
• NP-Completeness
• Network Flow

Textbook: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, Third Edition (MIT Press, 2009).

Grading: Grading will be based on homework assignments, a midterm, and a final exam. The midterm and final exam will be in-class, and all students must attend the on campus exam. Any exceptions must be discussed with the instructor, and approved in advance. The timing will be determined in a manner that avoids conflicts with other classes. The tentative scheme for grading is:

• Homeworks 30%
• Midterm Exam 30%
• Final Exam 40%.

Homework Policy:

• Late homework will generally NOT be accepted. If there are extenuating circumstances, you should make prior arrangements with the instructor.
• You can collaborate on homework problems with other students in the class. However, you must write up each problem solution by yourself without assistance.
• Homework submissions must be typeset. Handwritten submissions will NOT be accepted. These must be uploaded to SCIS Moodle in PDF format only.

Assignments:

Announcements:

Schedule: