1.Do we need to know the proofs of the theorems taught during the semester for the test? I mean, are questions like "prove Hall theorem" or "prove Max-Flow-Min-Cut" or "prove the correctness of algorithm Dijkstra" could be in the exam?
2. Can we fill free to use any theorem that was proven in lecture or recitation or H.W without proving it again in the test?
3. Can we fill free to use any algorithm taught in the lectures or recitations or H.W without describing it again, and without proving correcness and proving its runtime complexity?