CS 575 Design and Analysis of Algorithms    Spring 2013

Goals:

This course introduces students to the design and analysis of algorithms, a basis of computer science. Upon completion of this course, students will be able to analyze the asymptotic performance of algorithms, understand major algorithms and data structures, and apply important algorithmic design paradigms and methods of analysis. This course is designed for CS graduate students.

Class Schedule: T R 2:50 PM - 4:15 PM

Classroom:  SW 329

Instructor: Dr. Lei Yu  

TA: Kaoning Hu

Telephone:  (607) 777-6250

 

Email: lyu AT cs DOT binghamton DOT edu  

Email:  khu1 AT binghamton DOT edu

Office Location: G16, Engineering Building

Office Location: Engineering Building

Office Hours: T R 4:15PM - 5:00PM or by appointment

Office Hours:

Prerequisite:

  • CS333 (Undergraduate Algorithms and Data Structures) or equivalents
  • Programming skills: programming assignments can be implemented in any popular programming languages, such as C, C++, or Java. No programming-specific issues will be covered in this course.

Topics:

  • Introduction
  • Time Complexity and Asymptotic Growth Functions
  • Divide and Conquer
  • Dynamic Programming
  • Greedy Algorithms
  • Probabilistic Algorithms
  • Backtracking
  • Branch and Bound
  • Hashing
  • Theory of NP

Textbook:

  • Introduction to Algorithm, Cormen, Leiserson, Rivest and Stein, 3rd edition, MIT Press, 2009. 

Assignments:

  • 4 theory assignments in the form of written exercises on key concepts and algorithms.
  • 2 programming assignments in the form of implementation and experimentation with key algorithms.

Examinations:

There will be several quizzes and two exams in class.

Grading:

Final grades will be based on quizzes (10%), theory (4 assignments, 20%), programming (2 assignments, 20%), Exam I (25%), Exam II (25%).

Academic Integrity:

Discussion of general concepts and questions concerning the homework assignments among students is encouraged. However, each of you is expected to work on the homework solutions on your own. Sharing of any part of solutions is prohibited. If you are unclear about the policy, please consult with the instructor before you act. Suspected cases of academic misconduct will be pursued fully in accordance to the Student Academic Honesty Code of Thomas J. Watson School of Engineering and Applied Science, Binghamton University.

Late Policy:

Each assignment is due at the beginning of class on the due date. Any assignment received within the next 24 hours will be penalized by 20% of the full credit; any assignment received within the time between 24 hours and 48 hours pass the deadline is penalized by 50% of the full credit; No assignment will be accepted after 48 hours pass the deadline. Rare exceptions of this policy may be made at the discretion of the instructor under demonstrably circumstances.