Skip Navigation Links.

BIL519 - Advanced Algorithm Analysis

Instructor: Asst.Prof.Dr.Alper Kürşat UYSAL
Teaching Assistants:
Course Book: Introduction to Algorithms: Rivest, Lieserson, Stein, Adelman
Grading: Midterm: 35%, HW: 20%, Final: 45%
Other Resources:
Course Outline:
1. Week

Asymptotics etc.


2. Week

Sorting


3. Week

Heaps and HeapSort


4. Week

Introduction to Computational Geometry Algorithms
Closest Pair
Convex Hull
Farthest Pair


5. Week

Greedy Algorithms


6. Week

MIDTERM I


7. Week

Introduction to Dynamic Programming
0-1 Knapsack Problem


8. Week

Union-Find Data Structure


9. Week

Graphs: Review, BFS, DFS, Toplogical Sort, CutVertex, Euler Circuits


10. Week

Minimum Spanning Trees


11. Week

Single Source Shortest Paths
All Pairs Shortest Paths


12. Week

MIDTERM II


13. Week

NP-Completeness


14. Week

Approximation Algorithms


Home | Department | Undergraduate | Graduate | Research | Continual Improvement

© 1993-2017 CENG. All rights reserved.