Description
Each homework assesses your mastery over the topics covered in the course so far.
Purpose
This homework covers algorithm analysis and design. Specific topics include: asymptotic notation, master theorem, recurrence relations, diviceand-conquer algorithms.
Background
To attempt and submit the homework you will need – to formulate a loop invariant and use it to prove algorithm correctness – knowledge of techniques to solve recurrence relations – understanding of asymptotic notation – comfort with the mathematical tools used in the analysis of algorithms – the ability to interpret a scenario as an algorithmic problem – comfort with GitHub and LaTeX
Task and Submission
Grading
The score earned by your submission will be assigned to the team assuming that the buddies contributed equally. To confirm, teams will be occasionally called in for a viva on their submission. If any of the members is unable to explain the submission or does not appear for the scheduled viva, the team will lose marks for the homework. You are encouraged to report non-contributing buddies through the appropriate form.
For discussion on the HW, please use the related Canvas discussion thread. viel Spass!
