As you might know already, the final exam is on Thu 12 Nov 2015 from 08:45 am – 12:00 noon in room Mathews 307.
If you can use some results from the literature, there is no need to copy the proofs. Stating the results and giving a reference is enough. For example, the NP-completeness result from the following paper might be useful.
David Eppstein: Finding Large Clique Minors is Hard. J. Graph Algorithms Appl. 13(2): 197-204 (2009).
The final mark for this course will be computed as follows:
final_exam/2 + midterm/4 + (a1+2*a2+a3 - min(a1,a2,a3))/12
which is then rounded to the nearest integer (in your favour if the fractional part is 0.5) and capped at 100.
Good luck with the third assignment (for those of you who attempt it)!