3 Projects made during Analysis and Synthesis of Algorithms class:
Proj 1 - Cpp: Dynamic Programming adaptation of the Knapsack algorithm for 2 dimensions;
Proj 2 - Cpp: Adaptation of the Kosaraju's algorithm to count the maximum number of connections between SCCs in a graph;
Proj 3 - Python: Linear Programming using PuLP library;
Each folder contains the code to the project, its prompt and final report and a generator of instances for the project's program, as well as makefile if needed.