An algorithm is a procedure or method for solving problems that arise across a wide range of computing applications. However, algorithmic problems in these domains are rarely formulated in a mathematically well-established way; they often include application-specific details, most of which are nonessential auxiliary elements.
The goal of this course is to understand how to systematically formulate problems and, based on that, to learn how to design correct and efficient algorithms.
- The course begins with an introduction to algorithms and then covers five core algorithm design techniques. It also addresses computational complexity theory and advanced algorithms.
- In addition, through Project-Based Learning (PBL) problem-solving, students enhance their understanding of algorithms and their problem-solving skills by actively learning in teams: designing, implementing, and presenting algorithms for real-world problems.

CSED101: Programming and Problem Solving
CSED233: Data Structures

Algorithms / Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani / McGraw-Hill / ISBN 9780071259750
Algorithms / Jeff Erickson / PDF version available at http://algorithms.wtf / ISBN 9781792644832
Algorithm Design / Jon Kleinberg, Éva Tardos / Addison Wesley / ISBN 9780321295354

Week 1: Computational Efficiency
Week 2: Divide-and-Conquer Algorithms
Week 3: Graph Algorithms
Week 4: Greedy Algorithms, Shortest Paths
Week 5: Dynamic Programming
Week 6: NP-hardness
Week 7: Approximation Algorithms
Week 8: Midterm Exam.
-------------------------------
Week 9-12: PBL 1 - Problem Solving
Week 13-15: PBL 2 - Problem Solving
Week 16: Final Exam.