IV003 Algorithms and Data Structures II

Sets of problems

Assignments are given in English. Solutions are accepted in both Czech/Slovak and English.

You can solve problems either individually or in pairs.   All problems from one set have to be solved in the same way, i.e. either all individually or all in the same pair. In case you solve the problems with your colleague, both of you are rewarded the same number of points (points are not divided).  Cooperation of larger groups, as well as plagiarism, are strictly prohibited (and result in grading F).


How to write solutions  

Please, consult the  from UC Berkley.
Follow good monographs (i.e. in books Design Algorithm by Tardos and Kleinberg and Algorithms by Erickson you can find plenty of solved exercises). 
 

Questions?

Ask in the course discussion group.  

 

Technical stuff  

All materials can be found in the Information system, in Study materials. Make use of the iv003.cls and upload the resulting pdf file into the respective Homework vault. If you solve the problems in a pair, only one of the students loads the solutions. You declare the cooperation through a respective ROPOT. 


Deadlines

  • Set 1 80 points, deadline 17.3.2020
  • Set 2 80 points, deadline 14.4.2020   extended to 21.4.2020
  • Set 3 40 points, deadline 12.5.2020

 

TeX

How to use