- Instructor: Prof.
Sung-Hyuk Cha
- Email: scha@pace.edu
- Office: 15 Beekman st. rm 1119
-
Office Hours: 3:20pm ~ 5:50pm on Wednesday, and Thursday
- CRN: 20813 / 21329
- Meeting:
- Meeting Times:R 12:15 - 03:15 PM,
Spring 2026
- Place:BK 1111
- Textbook: 7 Algorithm Design Paradigms, 2020,
by Sung-Hyuk Cha
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: Permission required.
- Lecture Notes: can be accessed using the http://classes.pace.edu.
- Tentative Schedule:
| Week | Topic Chapters |
|---|
| 1 (1/29) |
Ch 1 Introduction, Summations, and Asymptotic notations
|
| 2 (2/5)
|
Ch 2 Inductive Programming
|
| 3 (2/12)
|
Ch 3 Divide & Conquer (Master theorem)
|
| 4 (2/19)
|
Ch 4 Greedy algorithms
|
| 5 (2/16)
|
Ch 5 Tabulation method
|
| 6 (3/5)
| Ch 6 Higher dimensional tabulation
|
| 7 (3/12)
|
Ch 6 (Computational Combinatorics and string matching)
|
| 8 (3/19)
|
Ch 7 Stack and Queue
|
| 9 (3/26)
|
Ch 9 Priority queue
|
| 10 (4/2)
|
passover
|
| 11 (4/9)
|
Ch 10 Reduction
|
| 12 (4/16)
|
Ch 11 NP completeness
|
| 13 (4/23)
|
Ch 12 Randomized and approximate algorithms
|
| 14 (4/30)
|
Ch 8 Dictionary problem
|
| 15 (5/7)
|
Study Day
|
| 16 (5/14)
|
Final Exam
|
- Evaluation:
- Attendance (10%): Attendance
- Homeworks (10%): There will be weekly homework
assignments.
- Quiz (30%): There will be weekly 10 minute quiz.
- Final Exam (50%): serves as the qualifying exam for doctorate students.
|