CST370

Design and Analysis of Algorithms

Graphs, trees, heaps, and algorithm efficiency

Design and Analysis of Algorithms provided a rigorous look into the efficiency of core algorithms and the implementation of complex data structures like graphs, trees, and heaps. I practiced diverse design techniques—from divide-and-conquer to dynamic programming—to find optimized solutions for computational problems across various disciplines. Studying algorithms sharpened my logical thinking, teaching me that the most powerful tool in a developer’s kit is the ability to break down a complex problem into solvable parts.

Work from this course

1 entry
  • 2025-07-15 #cst370

    All-Pairs Shortest Path: Floyd–Warshall Algorithm

    This algorithm project for CST370: Design and Analysis of Algorithms focuses on the implementation and formal analysis of the Floyd–Warshall algorithm to solve the all-pairs shortest path problem. I explored how dynam...
← All coursework