COT 4400 (2014 Fall) Design and Analysis of Algorithms


Announcement

(The content of this page changes frequently)


Instructor: Dr. Xingquan (Hill) Zhu
Class Time: Tuesday & Thursday 5:30 PM - 6:50 PM
Classroom: FL 401
Office Hour: Tuesday, Thursday 1:00 PM - 4:00PM

Textbook: Introduction to Algorithms (2nd Edition), the MIT Press, 2001, ISBN-10: 0262032937, ISBN-13: 978-0262032933 .
Customer Reviews from Amazon


Course Description:   This course will provide a comprehensive introduction to the design and analysis of algorithms. We will discuss classic problems (e.g., sorting and traveling salesman problem), algorithm design strategies (e.g., divide-and-conquer, greedy approaches), alorithms and data structures (e.g., hash tables, Dijkstra's algorithm), and graph algorithms (e.g., minimum spanning trees and single-source shortest paths). We will also analyze algorithm complexity throughout, and touch on issues of tractibility such as "NP-Completeness".

Topics:

Prerequisites:

Lectures, Assignments, and Projects

Course lectures by week
Homeworks
Projects
Resources


Grading policy:
Quizzes 20
Homework 40
Participation 5
Final 35

Your final grade will be based on the scores you have earned from the above categories (compared to the performance of other students in the class).

Late policy:

All assignments are due midnight on the assigned due date. Please refer to the Assignments and Projects for details on submission. Late submission is allowable, however, the late penalty is -2pts/day.

Communication:

All important course communication will be done using your fau.edu email address. Sending email to me from another account is disencouraged, and if you do you must set the reply-to field to your FAU email account if the message concerns grading or evaluation in any way. You must also include your name in all messages concerning the course. If you have your FAU email forwarded to an AOL or other email account, read this important notice concerning blocking of FAU email.

All work in this course must be INVIDUAL effort unless specified otherwise.