Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
programming_ii_2015-16_summer_semester [2016/04/24 21:51] jakub.gemrot |
programming_ii_2015-16_summer_semester [2016/05/11 17:14] jakub.gemrot |
||
---|---|---|---|
Line 26: | Line 26: | ||
* Graph Algorithms | * Graph Algorithms | ||
- | **Workshop 11** **(5.5.2016)** | + | ======Workshops: |
- | * Test Driven Development | + | |
- | **Workshop | + | **Workshop |
- | * Extreme Programming | + | **(12.5.2015, 14:00)** |
+ | * Test Driven Development | ||
+ | * What is TDD, why we should do it, how to do it in C# | ||
+ | * [[http:// | ||
+ | * Assignment | ||
+ | * Provide complete code coverage for Heap class | ||
+ | * Are there any bugs? | ||
+ | * //10 points + 3 (meeting the deadline)// | ||
- | **Workshop | + | **Workshop |
- | * Graphics, WinForms, Exceptions, Lot of fun! | + | **(5.5.2016, 14:00)** |
- | + | * Extreme Programming | |
- | ======Workshops: History====== | + | * Pair programming in practice |
+ | * [[http:// | ||
+ | * Assignment | ||
+ | * Continue with the code you have created during the workshop | ||
+ | * Implement flexible layouting of the tree and a way to add multiple numbers at once | ||
+ | * Deadline: 12.5.2016 | ||
+ | * //10 points// + //5 bonus points// (meeting the deadline) | ||
**Workshop 9** [[http:// | **Workshop 9** [[http:// |