Algorithms and Implementations
Design, analysis, implementation, and use of computer algorithms. Introduction to fundamental data structures, sorting, recursive programs, dynamic data structures, memory management, algorithm design techniques and complexity analysis, and applications in optimization problems. Examples from linear and integer programming, covering, knapsack, graph-theoretic problems, network analysis, and scheduling.
Prerequisites & course information
Design, analysis, implementation, and use of computer algorithms. Introduction to fundamental data structures, sorting, recursive programs, dynamic data structures, memory management, algorithm design techniques and complexity analysis, and applications in optimization problems. Examples from linear and integer programming, covering, knapsack, graph-theoretic problems, network analysis, and scheduling.
Sources
- Course catalogue ↗2026-2027