[[https://www.fel.cvut.cz/en/education/rozvrhy-ng.B192/public/html/predmety/57/20/p5720406.html|Timetable at FEE]]
[[https://www.fel.cvut.cz/en/education/rozvrhy-ng.B192/public/html/paralelky/P57/20/par5720406.1.html|Students of PGE]] 
[[https://cw.felk.cvut.cz/brute/|Upload system BRUTE]]
[[https://cw.felk.cvut.cz/forum/forum-1637.html|Discussion board]]
[[https://cw.fel.cvut.cz/wiki/courses/be5b33prg/start|PRG]]


===== PGE Practices =====


Download the examples and run them in your python environment. \\
Follow the assignments at the end of the code and calculate results or modify the code accordingly.

**1.  Understanding efficiency of code fragments and entire program** \\

[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#maximum_sum_of_a_contiguous_subsequence|Maximum sum of a contiguous subsequence]] \\
[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#hi-lo_game_and_1d_battleships_game_with_variants|Hi-Lo game and 1D battleships game, with variants (kind of programming warm-up)]]

**2.  1D array and list processing, Python built-in functions ** \\
[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#d_array_problems| 1D array problems, solve them all]]


**3.  2D arrays training problems  ** \\ 
If the problems are too trivial for you, prove it by solving the last one in the problem list and show your solution to the teacher. After that you will be not obliged to solve the other problems. Otherwise, work through the problems one by one according to your capacity.

[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#d_array_problems1| 2D array problems, again, solve them all.]]

----

**6.  Text files processing, text search  ** \\

The list of exercises is available at  
[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#text_files| Exercises page]].\\

**7.  Effectivity of search and sort methods on various datasets  ** \\

The list of exercises is available at  
[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#searching_sorting|Exercises page]].\\


**8.  stack, queue, tree – and their implementation **\\ 

The (small) list of exercises is available at  
[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#adt_bfs|Exercises page]]

**9 and 10.  Recursive functions and procedures. Recursive generation of data/objects  ** \\
The list of exercises is available at  
[[https://cw.fel.cvut.cz/wiki/courses/be5b33pge/practices/code#recursion_i| exercises page]].\\

**11.  Basics of User Interface, TKinter ** \\ 

**12.  Debugging, testing, writing clean code ** \\

**13.  Scientific and math computations with Numpy and Scipy ** \\ 

**14.  Data processing visualisation with Python libraries   ** \\