COP-4534: Algorithm Techniques (Fall 2018)

Location: ECS 136
Time: Tuesday and Thursday 11:00 -- 12:15
Instructor: Ning Xie (office ECS 380)
    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

Topics:

• Mathematics Background, Algorithm Analysis
• Lists, Stacks and Queues
• Trees and Heaps
• Hashing and Disjoint Sets
• Divide and Conquer
• Sorting Algorithms
• Graphs & Graph Algorithms
• Dynamic Programming

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:

• Homework 40%
• Midterm Exam 20%
• Final Exam 40%.

Homework Policy:

• You are allowed to form a group with no more than 3 students to work on homework together. However, you must write up each problem solution by yourself without assistance.
• Late homework will generally NOT be accepted. If there are extenuating circumstances, you should make prior arrangements with the instructor.
• Homework submissions must be uploaded to SCIS Moodle.

Assignments:

Announcements:

Schedule: