Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Last revision Both sides next revision | ||
|
programming_i_2018-19_winter_semester [2018/11/30 10:37] jakub.gemrot |
programming_i_2018-19_winter_semester [2019/01/18 15:19] jakub.gemrot [Credit Assignments] |
||
|---|---|---|---|
| Line 56: | Line 56: | ||
| ---------------------- | ---------------------- | ||
| + | |||
| + | ======Credit Assignments====== | ||
| + | * **18.1.2019**, | ||
| + | * [[https:// | ||
| ======Labs History====== | ======Labs History====== | ||
| + | |||
| + | ==== Lab 10 ==== | ||
| + | * **8.1.2019** | ||
| + | * Dynamic Trees, Binary Search Trees, definitions and implications | ||
| + | * **PRG1 - 2018 - L10 - BST** | ||
| + | * Create a program that will load integer numbers into the binary search tree dynamic structure | ||
| + | * Pretty print the result binary tree | ||
| + | | ||
| + | ==== Lab 09 ==== | ||
| + | * **19.12.2018** | ||
| + | * Recursion | ||
| + | * Fibonacci numbers, Factorial, Tower of Ha-noi, Quicksort | ||
| + | * No homework | ||
| + | |||
| + | ==== Lab 08 ==== | ||
| + | * **12.12.2018** | ||
| + | * Dynamic variables, new/ | ||
| + | * Homework in the ReCodEx group (Big Numbers / Fakt dlouhá čísla) | ||
| + | |||
| + | ==== Lab 07 ==== | ||
| + | * **4.12.2018** | ||
| + | * Arrays in Pascal, user types, record, passing the data via value and reference (var) | ||
| + | * Homework in the ReCodEx group (Train and the Bridge / Po mostě má přejet vlak) | ||
| ==== Lab 06 ==== | ==== Lab 06 ==== | ||