Exercises

Submission

Instructions

Home assignments should be submitted to mailbox 02 on Schreiber's ground floor (next to labs 004 and 005).
Please make sure to save a copy of the assignment in case it gets lost!

Extensions

  • If you would like an extension for the homework, you can have an automatic extension of 4 days (96 hours), without asking the course instructors (except for hw6, for which there are no extensions). An additional extension will only be given in case of miluim or sickness over 4 days long. There will be no exceptions.
  • If you have done miluim or were sick for more than 4 days, simply attach the "ishur" from the army/doctor to your homework and submit as usual, noting the time and date of submission (again, no need to ask for an extension).
  • You can have a 4-day extension for as many exercises as you like. Again, no need to ask us. The grader collects the homeworks on Monday at 12:00.
  • You may submit the exercise late if you don't make the second deadline, and 5% will be taken off for every day (or part of a day, measured from 12:00) that you are late (past the second deadline). That is, if the submission date is a Thursday and you submit the following Tuesday at 13:00, you will be deducted 10 points. If you are given a 6-day extension for being sick and submit it on Wednesday at 14:00, you will have 5 points deducted. If you submit late, please write the date and time of the submission clearly on your homework. If you falsify the submission time and are caught, you will be given 0 for all of the homeworks.

Grading

All exercises will consist of 8 questions. The final grade for the exercise will be the average of the best 7 answers.

Deadlines

All deadlines are 12:00 (noon) of the due date. This includes extensions.

Number Due Exercises Solutions
1 November 20 PDF PDF
2 December 4 PDF PDF
3 December 18 PDF -
3 January 1 PDF -

Clarifications

General Clarifications

Unless stated otherwise (or obvious from the context), the graphs are simple and are represented using adjacency lists (not using an adjacency matrix).

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License