Please choose two projects to implement from the following list.
You need to make sure the problem to be solved is challenging enough. For example, you may
use an array of 20+ elements, a matrix of student-hospital with 20+ candidates, a graph with
20+ nodes/edges and so on. Please define clearly the input and output of your problem.
- Gale-Shapley algorithm
- Breadth-first search
- Depth-first search
- Dijkstra’s algorithm
- Minimum spanning trees
- Bellman-Ford algorithm
- Dynamic programming
- Linear programming
- Cashers’ algorithm
- Flood fill
Submission: A single PDF (with your code link) with results and analysis.
- Please include your pseudocode, problem statement, input sequence, and output in the
- Report template:
a. Introduction and Background (aims/motivation, review/research),
b. Project Specification (goals/objective, problem design, and expected solution),
c. Implementation (evaluation, such as case studies),
d. Summary (conclusions),
Note: if you use python, you can attach code link from Google Colab. If you are using other
programming language, please attach an online complier link so we can run your code.