Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
programming_ii_2014-15_summer_term [2015/05/04 15:31]
jakub.gemrot
programming_ii_2014-15_summer_term [2015/05/11 20:49]
jakub.gemrot
Line 24: Line 24:
  
 ======Workshops: History====== ======Workshops: History======
 +
 +**Workshop 12**  [[http://artemis.ms.mff.cuni.cz/gemrot/lectures/prg2/2015/PrgII-2015-Workshop_12-Slides.pptx|(PPTX)]], [[http://artemis.ms.mff.cuni.cz/gemrot/lectures/prg2/2015/PrgII-2015-Workshop_12-Slides.pdf|(PDF)]] 
 +**(11.5.2015, 15:40)**
 +    * Graph Algorithms
 +      * Component labeling, Transition closure, Kruskal's algo, "Sringy" algo for graph layouting
 +    * Assignment
 +      * Implement "Springy" algo
 +      * Implement component labeling + Transition closure (using Visitor pattern)
 +      * Bonus: implement Kruskal's algo
 +      * //10 points + 5 (Kruskal) + 3 (meeting the deadline)//
 +
  
 **Workshop 11**  [[http://artemis.ms.mff.cuni.cz/gemrot/lectures/prg2/2015/PrgII-2015-Workshop_11-Slides.pptx|(PPTX)]], [[http://artemis.ms.mff.cuni.cz/gemrot/lectures/prg2/2015/PrgII-2015-Workshop_11-Slides.pdf|(PDF)]]  **Workshop 11**  [[http://artemis.ms.mff.cuni.cz/gemrot/lectures/prg2/2015/PrgII-2015-Workshop_11-Slides.pptx|(PPTX)]], [[http://artemis.ms.mff.cuni.cz/gemrot/lectures/prg2/2015/PrgII-2015-Workshop_11-Slides.pdf|(PDF)]] 
Line 33: Line 44:
       * Provide complete code coverage for Heap class       * Provide complete code coverage for Heap class
       * Are there any bugs?       * Are there any bugs?
-      * //10 points//+      * //10 points + 3 (meeting the deadline)//
  
  
programming_ii_2014-15_summer_term.txt · Last modified: 2015/05/11 20:49 by jakub.gemrot