1. Clarity and quality of general presentation: 30%
	2. Relevance to course: 20%
	3. Originality: 25%
	4. Amount of work done for the project [any coding? quality of references, topics covered
	   and related detail of description..] 25%
      

• Confusion between fill-path and fill-edge. A path is a sequence of vertices, like 4, 3, 2, 1, 5 for example. An edge is a sequence of 2 vertices: 2,5 for example In Exercise~1 you were asked for fill-paths in order to show what fill-ins will take place. Many (if not most) just showed the fill-ins of Gaussian elimination [or the fill-edges]. I took off 2 pts for this and another 1 pt if the error is repeated later (in part (e) - after the RCM ordering).
• In the GP algorithm: many of you did not set the vector properly. If you say

  	    [ii jj v] = find(A(:,j));
              Lst = TopSort(L, ii);
              w = sparse(ii,jj,...)
  	    ... or ...
  	    w = sparse(n,1) ..
  	    ... or .. many other similat statements
  	  

  then there will be fill-in -- meaning that internally matlab will reallocate to accomodate the new entries. You do all the work with TopSort - precisely to avoid this! I took off 4 or 5 points (depending on the situation).
• For Question 3 - part (a) - many of you gave a much more complex counter example than needed. I usually did not take off points for this..
• Finally, for Question~2 part (a), a few of you used the reverse permutation to get the adjacency graph. When you see pi = [1, 6, 5, 3, 2, 4], it means the numbers 1, 6, 5, ... are the old labels and the new graph will relabel these as 1, 2, 3, ..., (new labels).