CS 801 - Advanced Algorithms

  • Instructor: Prof. Sung-Hyuk Cha
    • Email: scha@pace.edu
    • Tel: (212) 346-1253
    • Office: 163 William St. 2nd floor rm 234
    • Office Hours: Tuesday 1:00 pm - 4:30 pm Thursday 12:30 pm - 2:00 pm


  • CRN: 22401

  • Meeting:

  • Textbook: One in preparation will be distributed in class by chapters weekly.
    Suggested book: Introduction to Algorithms, Cormen, Leiserson, Rivest, and Stein, Third Edition, MIT Press.

  • Resource: Dictionary of Algorithms and Data Structures

  • Course Description:
    Advanced topics in data structures and computational complexity, including randomized algorithms, dynamic programming, recurrence relations, amortized analysis, network flow algorithms, approximation algorithms and NP-completeness, will be discussed. This course covers both fundamental techniques and applications.

  • Prerequisites: offered only to PhD students

  • Lecture Notes: can be accessed using the http://blackboard.pace.edu.

  • Tentative Schedule:

    WeekTopic Chapters
    1 (1/24) Ch 1 Introduction, Summations, and Asymptotic notations
    2 (1/31) Ch 2 Inductive Programming
    3 (2/7) Ch 3 Divide & Conquer (Master theorem)
    4 (2/14) Ch 4 Greedy algorithms
    5 (2/21) Ch 5 Tabulation method
    6 (2/28) Ch 7 Reduction
    7 (3/7) Midterm
    8 (3/14) Spring Break
    9 (3/21) Ch 6 Two dimensional tabulation
    10 (3/28) Ch 9 Elementary data structures (Stack & Queue)
    11 (4/4) Ch 10 Priority queue (Static and dynamic heaps)
    12 (4/11) Passover
    13 (4/18) Ch 8 Randomized algorithms
    14 (4/25) Ch 12 NP completeness
    15 (5/2) Review
    16 (5/9) Final Exam

  • Evaluation:
    • Participation (10%): Attendance and class participation
    • Homeworks (20%): There will be weekly homework assignments.
    • Project (20%): a full report is required.
    • Midterm (25%):
    • Final Exam (25%): will be used for the qualifying exam.