Objective

The objective of the course is the study of techniques for designing algorithms, of fundamental algorithms and data structures and their effective use, and of methods for analyzing and comparing algorithms. Design techniques include brute force and divide-and-conquer. Fundamental data structures include trees, heaps, hash tables, and graphs. Special algorithms include sorting on linear data structures, hashing for tables, breath-first and depth-first traversals of trees and graphs, shortest-path and minimum spanning three algorithms, topological sort,connected components for graphs, and closet pair of points for a set of points. We analyze algorithms through the worst-case and average-case asymptotic complexity.

Texts

Introduction to Algorithms, Second Edition by Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein, McGraw-Hill 2nd edition (July 16, 2001), ISBN: 0070131511
It is ok, if you have the first ed. of the textbook.

• No late work will be accepted!
• No makeups

  Taking an exam (other than the final) on an alternative date is to the discretion of the instructor, and only if arrangements had been made a week prior to the original exam date. Only "valid" excuses, approved by the university, and with proper documentation will be accepted. In case of emergencies, proper documentation must be provided as well.
  

• Academic Honesty

  Any work you submit for grading must be your own. You should not copy from others, or give others sources to copy from.

  Cheating shall not be tolerated!
  

  Be familiar with the Academic Honesty Code. For your information the policy for handling violations of the academic honesty is in the Hofstra Pride Guide student handbook.