Course Information

Class Description

Techniques for designing efficient algorithms, including choice of data structures, recursion, branch and bound, divide and conquer, and dynamic programming. Complexity analysis of searching, sorting, randomized, and graph algorithms. Standard NP-complete problems and polynomial transformation techniques.


Assistant Professor Sael Lee
Office: Academic Bldg. B422
Email: sael at sunykorea dot ac dot kr
Phone: +82 (32) 626-1215

Meeting Time

[lecture] Mon/Wed 15:30~16:50 Academic Bldg. B204

Office Hours

Office Hours: Mon. 17:00-18:00 & Wed. 17:00-18:00 (or send emails for appointments) at B422




Introduction to Algorithms, Third Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein

Algorithms by Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh Vazirani. Textbook digital rental
The Algorithm Design Manual by Steven S Skiena (Nov 5, 2010)
An Introduction to the Analysis of Algorithms (2nd Edition) by Robert Sedgewick and Philippe Flajolet


Homework will be worth 15% of the grade.
Presentation on advanced algorithm topic of your choosing will be worth 10% of the grade.
Midterm will be worth 30% of your grade.
Finals (cumulative) will be worth 45% of your grade.


There will be assignments every two or so weeks. (4~5 in total)


You will do one presentation on an algorithm topic of your choice.


Course Materials

Subject to change.
1 2/29 1. Introduction: 1.1. Analysis of Algorithms
3/02 1.2. Computational models
2 3/07 Recurrence Relations: Even Split CLRS Ch4
3/09 Cont. Master Theorem CLRS Ch9
3 3/14 Uneven Split
3/16 Prune and Search: Selection Problem CLRS Ch33.4
4 3/21 Randomized Algorithms: Randomized Select Algorithm Design Ch13.6-7
3/23 Randomized Algorithms : Quick Sort Algorithm Design Ch13.6-7
5 3/28 2.4. Dynamic Programming - LCS
3/30 2.4. Dynamic Programming - 01 Knapsack
6 4/04 O-1 Kanpsack cont.
4/06 3. Trees
7 4/11 3.1. Balance Trees
4/13 NO CLASS - Election Day
8 4/18 MIDTERM: 2:00-3:30pm
4/20 NO CLASS - rescheduled Jun. 8th
9 4/25 3.2 Disjoint Sets - UNION-FIND
4/27 3.3. Amortized Cost
10 5/02 3.2. UNION-FIND cont. - Proof UNION-FIND proof
5/04 4.1. Fibonacci Heaps F-Heap
11 5/16 5. Graphs - 5.1. Maximum Flow - Ford-Fulkerson
12 5/18 5.2. Maximum Flow - Edmonds-Karp
12 5/23 5.3. Maximum Flow - Preflow
5/25 6. Lower Bounds - 6.1. Decision Trees
13 5/30 6.2. Problem Reduction
6/01 6.3. Adversary Argument
14 6/06 NO CLASS - Memorial Day
6/08 Presentation starting at 2:00p.m. (including makeup class)
F 07/20 (Mon) FINAL EXAM: 3:30-5:30pm

course policy

Attendance policy

Everyone is strongly urged to attend class regularly and actively participate. You will be responsible for learning all the materials covered in class. Notes and supplementary handouts will cover most of the material; however, in-class participation through engaging in discussions and asking questions should be valued learning activity.

Assignments grading policy

Assignment will be handed out in class and are due in class of the due date. Total points of each assignment will be different depending on the difficulty of the problems. However, the maximum total point of an assignment will be less than or equal to two times the minimum total point of an assignment. Expect to see difficult problems towards the end of semester.

You have budget of 5 days that you may submit your assignments late in total throughout the semester. Spend them as you will. There will be 10% late penalty for each day late exceeding the 5 day grace. There are no extensions given to individuals unless it is an extreme case of a proven emergency (this does not include family emergencies).

academic misconduct policy

There is no excuse in cheating. Cheating will be considered as an academic misconduct and handled according to the Stony Brook regulations. If cheating has occurred during exam or is evident in submitted assignments, your will get a grade of F. Discussion of assignments is acceptable, however, returned assignments must show originality. This means near duplicate assignments with your peers or duplications of materials found on the web will be considered cheating. All involved personals in cheating will be penalized.

university policy

americans with disabilities act

If you have a physical, psychological, medical or learning disability that may impact your course work, please contact Disability Support Services, ECC(Educational Communications Center) Building, Room 128, (631)632-6748. They will determine with you what accommodations, if any, are necessary and appropriate. All information and documentation is confidential.Disability Support Services .

academic integrity

Each student must pursue his or her academic goals honestly and be personally accountable for all submitted work. Representing another person's work as your own is always wrong. Faculty is required to report any suspected instances of academic dishonesty to the Academic Judiciary. Faculty in the Health Sciences Center (School of Health Technology & Management, Nursing, Social Welfare, Dental Medicine) and School of Medicine are required to follow their school-specific procedures. For more comprehensive information on academic integrity, including categories of academic dishonesty please refer to the academic judiciary website at Academic Judiciary

critical incident management

Stony Brook University expects students to respect the rights, privileges, and property of other people. Faculty are required to report to the Office of University Community Standards any disruptive behavior that interrupts their ability to teach, compromises the safety of the learning environment, or inhibits students' ability to learn. Faculty in the HSC Schools and the School of Medicine are required to follow their school-specific procedures. Further information about most academic matters can be found in the Undergraduate Bulletin, the Undergraduate Class Schedule, and the Faculty-Employee Handbook.