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
Last revision Both sides next revision
programming_i_2018-19_winter_semester [2018/11/30 10:36]
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**, SW2
 +    * [[https://docs.google.com/document/d/1MqgaNNpdd75YyFFYWcTcYxhEdfIb1bED9AVDqNzk3TM/|Sorting in dynamic structures]]
  
 ======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/dispose, linked lists
 +  * 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 ====
Line 72: Line 99:
       - You are given a string that should contain a whole number; return the number without its first digit. Return 0 if the string does not contain a whole number or the number contains only single digit.       - You are given a string that should contain a whole number; return the number without its first digit. Return 0 if the string does not contain a whole number or the number contains only single digit.
       - You are given a string, return the same string but convert all lower-case characters into their upper-case variants.        - You are given a string, return the same string but convert all lower-case characters into their upper-case variants. 
-        * This is experimentally entered into ReCodEx, try to solve this by submitting the solution to ReCodEx! +        * **This exercise has been experimentally assigned to your group in ReCodEx, try to solve this by submitting your solution through ReCodEx!**
  
 ==== Lab 05 ==== ==== Lab 05 ====
programming_i_2018-19_winter_semester.txt · Last modified: 2019/01/25 16:16 by jakub.gemrot