COMPENG 3SM4
Algorithm Design & Analysis
Winter
Topics
- Efficient algorithms
- Related discrete mathematics
- Data structures
- Sets
- Function relations
- Graph theory
- Graph algorithms (graph traversals
- Topological sort
- Minimum spanning trees
- Shortest paths
- Balanced trees and advanced data structures
- Algorithmic design strategies (dynamic programming
- Greedy algorithms
- Divide-and-conquer
Readings
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms, 3rd or 4th Edition, MIT Press.
- Mark Allen Weiss, Data Structures and Problem Solving Using Java, 3rd or 4th Edition, MIT Press and McGraw-Hill.
- Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, Data Structures and Algorithms in Java, 6th Edition , Wiley
- Kenneth H. Rosen, Discrete Mathematics and Its Applications, 7th or 8th ed., McGraw Hill (ISBN 978-0073383095).ISBN 9780073383095
- Recommended Reading:
Sources
- Course catalogue ↗2026–2027
- Academic calendar ↗
- Campus Store reading list ↗Winter 2026
- Course outline / syllabus ↗Winter
- The outline states that no textbook is required or used.