Graph-Theoretic Algorithms
Spring 2017
Assignments
Graph-Theoretic Algorithms
|
|
| Home | Outline | Resources | Schedule | Summaries | Assignments | Project | Exams |
All assignments are optional. Any assignment-credit that you do not get automatically transfers to the final exam. However, you should attempts the assignments anyway, because they are good practice in what you've seen in course, and useful practice for the final.
You're welcome to talk to each other and to me about the assignments, and to read and use any resource that you may find. However, acknowledge all help you received (other than myself and the lecture notes) in your answer.
Group work is allowed (up to 3 students), and groups only need to hand in one answer (marked clearly with all names of all group-members). However, every student in the group must be able to explain every step of the answer.
Assignments should be handed in by putting a PDF-file in the "Dropbox" region of assessments on the Learn web page for cs762. (Alternatively, you can email me your PDF. However, then you cannot revise your submission; the first emailed version will be used.)
LaTeX is encouraged but not required. Scans of handwritten answers or pictures are acceptable.
The deadline is Friday night at 23.59pm. Late assignments will not give assignment-credit (but will probably be used in your final exam). No exceptions. (Recall that assignment-credit is never lost, since it transfers to the final exam).
Assignment-credit depends on your ability to answer questions about your written answer. I will contact you if/when I would like to meet with you for you to do such explanations. I am planning to meet with all students at least once for such a meeting.
