Assignment 0

Due Thu Jan 25, at 11:59pm.

Assignment 0 was released on January 10. It covers prerequisite linear algebra and probability knowledge.

If you want to type your solutions up in LaTeX, then the .tex code for the problems is available on Quercus under the files tab. In the case of disagreement between the .tex and the .pdf here, the .pdf on this page contains the correct questions.


UPDATE: Question 6b was corrected to specify that a positive semi-definte matrix must be symmetric (therefore, any eigenvalues will be real). You don't need to consider complex values for this question.

Assignment 1

Due Thu Feb 15, at 11:59pm.

Assignment 1 was released on Jan 25. We will cover the material needed for Q1 and Q4 during Week 4 of class.

If you want to type your solutions up in LaTeX, then the .tex code for the problems is available on Quercus under the files tab. In the case of disagreement between the .tex and the .pdf here, the .pdf on this page contains the correct questions.

To help you with the assignment, a collection of practice questions that are NOT for marks are available above; you will have time to work on the practice problems and to discuss with your classmates and the TA in tutorial, week 5.


UPDATE: Q2d was corrected to read "dispersion of the edge" instead of "dispersion of an edge"

UPDATE2: Two minor phrasing clarifications:
1. Q2d has been corrected to read "dispersion of the edge" instead of "dispersion of an edge"
2. Q3a has been clarified, it now asks for the "corresponding graph" G_T, such that MinSTC on G is equivalent to min vertex cover on G_T
UPDATE3: Phrasing clarification to Q3d: when a node is removed, then any edges that are no longer well-defined should also be removed.
UPDATE3: Q1c wording has been adjusted for clarity -- you only need to show that your found relationship holds for a zero eigenvector of your choice; you do not need to prove that it will hold for all zero eigenvectors of L(G).

Assignment 2

Due Thu Mar 21, at 11:59pm.

Assignment 2 is due Thu Mar 21. We will finising cover the material needed by the end of Week 8 of class.

If you want to type your solutions up in LaTeX, then the .tex code for the problems is available on Quercus under the files tab. In the case of disagreement between the .tex and the .pdf here, the .pdf on this page contains the correct questions.

To help you with the assignment, a collection of practice questions that are NOT for marks is available here, you will have time to work on the practice problems and to discuss with your classmates and the TA in tutorial, week 9.

Critical Review

If this is your first time reading a computer science paper, then you can find a collection of good advice here.

Choice of Groups & Paper Due Fri Mar 1, at 11:59pm.

Draft Due Fri Mar 22, at 11:59pm.

Peer Reviews Due Fri Mar 29, at 11:59pm.

Final Version Due Thu Apr 4, at 11:59pm.


You will be reading a recent paper in groups of 3-4, and writing a critical review of the work. Details can be found in the rubric.
NOTE: To submit your group's draft of the critical review, as well as your individual peer review, please go to the Quercus Assignments tab, and submit both via PeerScholar.
Once this is done, the final version of the critical review for grading should be submitted via MarkUs.

Sample Reviews:
Example 1
Example 2

List of papers that have been claimed by groups: link