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/13 12:57] 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 ==== | ||
+ | * **27.11.2018** | ||
+ | * We have been talking about functions building chain of functions and reusing them, showing the result of function signature changes and how to work around it | ||
+ | * Tasks we have been working on, using only functions chr(x) and ord(x) | ||
+ | - Is this input a natural number (0 included)? | ||
+ | - Does this string contain a natural number (0 included)? | ||
+ | - Does this string a whole number? | ||
+ | * Homework | ||
+ | * **PRG2 - 2018 - L06 - Strings** - 4 programs; deliver them as functions | ||
+ | - How many digits this whole number stored in a string is containing? Return -1 if the string does not contain a whole number. | ||
+ | - What is the sum of digits in this whole number stored in a string? Return -1 if the string does not contain a whole number. | ||
+ | - 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. | ||
+ | * **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 ==== | ||
- | * **13.11.2018** | + | * **20.11.2018** |
- | * We're going to feedback | + | * We've been going through |
+ | * We touched string functions and procedures in Pascal | ||
+ | * Examples here: [[https:// | ||
==== Lab 04 ==== | ==== Lab 04 ==== |