- Instructor: Prof.
Sung-Hyuk Cha
- Email: scha@pace.edu
- Office: 15 Beekman st. rm 1119
-
Office Hours: 4:10pm ~ 5:50pm on Tuesday, Wednesday, and Thursday
- CRN: 21484 / 20900
- Meeting:
- Meeting Times:T 06:10 - 09:00 PM,
Spring 2025
- 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/21) |
Ch 1 Introduction, Summations, and Asymptotic notations
|
| 2 (1/28)
|
Ch 2 Inductive Programming
|
| 3 (2/4)
|
Ch 3 Divide & Conquer (Master theorem)
|
| 4 (2/11)
|
Ch 4 Greedy algorithms
|
| 5 (2/18)
|
Ch 5 Tabulation method
|
| 6 (2/25)
| Ch 6 Two dimensional tabulation
|
| 7 (3/4)
|
Ch 7 Stack and Queue
|
| 8 (3/11)
|
Ch 8 Dictionary problem
|
| 9 (3/18)
|
Spring Break
|
| 10 (3/25)
|
Ch 9 Priority queue
|
| 11 (4/1)
|
Ch 10 Reduction
|
| 12 (4/8)
|
Ch 11 NP completeness
|
| 13 (4/15)
|
Ch 12 Randomized and approximate algorithms
|
| 13 (4/22)
|
Review
|
| 14 (4/29)
|
Study Day
|
| 15 (5/6)
|
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.
|