This repository contains my solutions to the homework assignments of COMP251(Fall 2019).
I enjoyed the course and learned a lot. Hope you like it too!
ALL questions and starter code are provided by the awesome course instructors, so all credits go to them!
A special thanks to Virna Xi for helping me survive the Montréal winter by discussing the proofs with me
Coding: Hash Table (Chaining/Open-addressing)
Long Answer: some proofs on complexities
Grade Achieved : 35/30
Coding: Disjoint Sets, Minimum Spanning tree, Greedy algorithm
Long Answer: proofs on canonicalness, disjoint sets, greedy algorithm
Grade Achieved : 45/40 // proof was curved
Coding: Ford-Fulkerson, Bellman-Ford
Long Answer: proofs on correctness of dynamic programming algorithm, bounded knapsack, unbounded knapsack
Grade Achieved : 55/50 // (-5) Base case for w=0 missed.
Coding: Graph, graph, graphs :) (Karatsuba algorithm, min-cut, etc.)
Long Answer: proofs on greedy algorithm and complexity analysis
Grade Achieved : 45/40 //No need to change the log base.