CourseWare Wiki
Switch Term
Winter 2023 / 2024
Winter 2022 / 2023
Winter 2021 / 2022
Winter 2020 / 2021
Winter 2019 / 2020
Winter 2018 / 2019
Older
Search
Log In
b181
courses
b4m33pal
ulohy
Warning
This page is located in archive. Go to the latest version of this
course pages
.
Differences
This shows you the differences between two versions of the page.
View differences:
Side by Side
Inline
Go
Link to this comparison view
Both sides previous revision
Previous revision
2019/02/13 21:19 berezovs
2019/02/13 21:17 berezovs
2019/02/13 21:07 berezovs
2019/02/13 20:56 berezovs
2019/02/13 20:53 berezovs
2019/02/13 20:50 berezovs
2019/02/13 20:42 berezovs
2019/02/13 20:33 berezovs
2019/02/13 20:29 berezovs
2019/02/13 20:12 berezovs
2019/02/13 20:12 berezovs
2019/02/13 20:10 berezovs
2019/02/13 20:06 berezovs
2019/02/13 19:03 berezovs
2018/09/24 15:10 external edit
Go
2019/02/13 21:19 berezovs
2019/02/13 21:17 berezovs
2019/02/13 21:07 berezovs
2019/02/13 20:56 berezovs
2019/02/13 20:53 berezovs
2019/02/13 20:50 berezovs
2019/02/13 20:42 berezovs
2019/02/13 20:33 berezovs
2019/02/13 20:29 berezovs
2019/02/13 20:12 berezovs
2019/02/13 20:12 berezovs
2019/02/13 20:10 berezovs
2019/02/13 20:06 berezovs
2019/02/13 19:03 berezovs
2018/09/24 15:10 external edit
Go
courses:b4m33pal:ulohy [2019/02/13 21:17]
berezovs
courses:b4m33pal:ulohy [2019/02/13 21:19]
berezovs
Line 93:
Line 93:
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=geneng|Genetic engineering]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=geneng|Genetic engineering]]\\
+
----
----
----
**Older problems in Czech**
**Older problems in Czech**
**Directed graphs** \\
**Directed graphs** \\
-
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=hradlova_sit|CZ Hradlová
sí
]]\\
+
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=hradlova_sit|CZ Hradlová
síť
]]\\
**Generation of various combinatorial structures**\\
**Generation of various combinatorial structures**\\
Line 106:
Line 106:
**Graph searching** \\
**Graph searching** \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=prumergrafu|CZ
Prùmìr
grafu ]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=prumergrafu|CZ
Průměr
grafu ]]\\
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=mosty|CZ Nepostradatelný datový kanál]]\\
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=mosty|CZ Nepostradatelný datový kanál]]\\
**Minimum spanning trees** \\
**Minimum spanning trees** \\
[[https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=asfalt|CZ Asfaltové silnice]]\\
[[https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=asfalt|CZ Asfaltové silnice]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pripojeni|CZ
Pøipojení
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pripojeni|CZ
Připojení
]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pocitacova_sit|CZ
Poèítaèová sí
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pocitacova_sit|CZ
Počítačová síť
]]\\
**Priority queue(s)**\\
**Priority queue(s)**\\
Line 122:
Line 122:
+
----
----
----
Line 135:
Line 135:
Parsing \\
Parsing \\
-
[[http://cmp.felk.cvut.cz/~berezovs/algo/vyrazy/zadani.pdf|CZ Vyhodnocování
øetìzcových
výrazù]]\\
+
[[http://cmp.felk.cvut.cz/~berezovs/algo/vyrazy/zadani.pdf|CZ Vyhodnocování
řetězcových
výrazù]]\\
courses/b4m33pal/ulohy.txt
· Last modified: 2019/02/13 21:19 by
berezovs