University Computer Science
Algorithm Design
Advanced algorithmic approaches and design strategies used to solve complex problems in optimal time.
Curriculum / Syllabus
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming
- Graph Algorithms (BFS, DFS, Shortest Paths, MST)
- Network Flow
- NP-Completeness and Computational Tractability
Exam & Course Strategy
Based on analyzing a problem, designing an algorithm from scratch, and mathematically proving its correctness and complexity.