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
Next 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
courses:b4m33pal:ulohy [2019/02/13 20:50]
berezovs
courses:b4m33pal:ulohy [2019/02/13 21:19]
(current)
berezovs
Line 1:
Line 1:
\\
\\
-
Dosavadní programovací úlohy PAL přibližně dělené podle tématiky. Úlohy u zkoušek jsou označeny (ZK)
.\\
+
+
Programming problems form previous years
.\\
----
----
**Directed graphs** \\
**Directed graphs** \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxpath |Maximum path
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxpath |Maximum path]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=ski|Downhill skiing]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=ski|Downhill skiing]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=circus|Travelling circus]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=circus|Travelling circus]]\\
-
[[http://cmp.felk.cvut.cz/~berezovs/algo/shortcutedges/desc.pdf|Shortcut edges
(ZK)]]\\
+
[[http://cmp.felk.cvut.cz/~berezovs/algo/shortcutedges/desc.pdf|Shortcut edges ]]\\
-
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=hradlova_sit|Hradlová síť
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=increasingload|Increasing Training Load]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=increasingload|Increasing Training Load]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=reverseedge |Reverse an Edge
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=reverseedge |Reverse an Edge ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=canalsinspection|Leaking canals inspection
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=canalsinspection|Leaking canals inspection ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wayfarers|Wayfarers
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wayfarers|Wayfarers ]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=bluepromenades|Blue Promenades]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=bluepromenades|Blue Promenades]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=express|Express Paths in Directed Graphs]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=express|Express Paths in Directed Graphs]]\\
Line 22:
Line 22:
**Generation of various combinatorial structures**\\
**Generation of various combinatorial structures**\\
-
[[https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=polymino|Polymino]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=mastermind|The Mastermind-- Assistant Program ]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=sachy|Šachová koncovka]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=counting_spanning_trees|Counting Spanning Trees]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=mastermind|The Mastermind-- Assistant Program
(ZK)]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=puzzle|The Puzzle ]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=shoda|Shoda stromů
]] \\
+
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=counting_spanning_trees|Counting Spanning Trees
(ZK)
]] \\
+
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=puzzle|The Puzzle
(ZK)
]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cave|The Deep Caves]] \\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cave|The Deep Caves]] \\
-
[[http://cmp.felk.cvut.cz/~berezovs/algo/isomorpicpermutations/desc.pdf|Isomorphic permutations
(ZK)
]] \\
+
[[http://cmp.felk.cvut.cz/~berezovs/algo/isomorpicpermutations/desc.pdf|Isomorphic permutations ]] \\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=segmentedbelts |Historical Segmented Belts]] \\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=segmentedbelts |Historical Segmented Belts]] \\
**Graph isomorphism** \\
**Graph isomorphism** \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomorphism|Small Graphs Isomorphism
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomorphism|Small Graphs Isomorphism ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=bintree_automorphism|Binary Rooted Tree Isomorphism
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=bintree_automorphism|Binary Rooted Tree Isomorphism ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cyclic_isomers|Cyclic Isomers
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cyclic_isomers|Cyclic Isomers ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomers|Acyclic Isomers
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomers|Acyclic Isomers
]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomers2|Acyclic Isomers II
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomers2|Acyclic Isomers II ]]\\
-
[[http://cmp.felk.cvut.cz/~berezovs/algo/similartrees/desc.pdf|Similar weighted binary rooted trees
(ZK)
]]\\
+
[[http://cmp.felk.cvut.cz/~berezovs/algo/similartrees/desc.pdf|Similar weighted binary rooted trees ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=treematch3|Tree isomorphism
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=treematch3|Tree isomorphism ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=molecules|Molecules
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=molecules|Molecules ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=networks|Connected Networks
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=networks|Connected Networks ]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=treecycle|Isomorphism of Tree-Cycle Graphs]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=treecycle|Isomorphism of Tree-Cycle Graphs]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=fewcycles|Isomorphism of Graphs with Few Cycles]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=fewcycles|Isomorphism of Graphs with Few Cycles]]\\
**Graph searching** \\
**Graph searching** \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=prumergrafu|Průměr grafu (ZK)]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=makefile_refactoring|Refactoring of a Simplified Makefile ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=makefile_refactoring|Refactoring of a Simplified Makefile
(ZK)
]]\\
+
[[http://cmp.felk.cvut.cz/~berezovs/algo/augmentingtrees/desc.pdf|Maximum Augmenting Sequence ]]\\
-
[[http://cmp.felk.cvut.cz/~berezovs/algo/augmentingtrees/desc.pdf|Maximum Augmenting Sequence
(ZK)]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=telescopes|Telescopes connection ]]\\
-
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=mosty|Nepostradatelný datový kanál
]]\\
+
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=telescopes|Telescopes connection
(ZK)
]]\\
+
[[http://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=marshcauseway|Marsh Causeway]]\\
[[http://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=marshcauseway|Marsh Causeway]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=roadtrip|Road Trip
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=roadtrip|Road Trip ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wordgameb|Word Game
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wordgameb|Word Game ]]\\
**Minimum spanning tree**s \\
**Minimum spanning tree**s \\
-
[[https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=asfalt|Asfaltové silnice]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cascade|Minimum Cascading Spanning Tree ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pripojeni|Připojení (ZK)]]\\
+
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pocitacova_sit|Počítačová síť]]\\
+
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cascade|Minimum Cascading Spanning Tree
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=campus|Campus]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=campus|Campus]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cable_TV|Cable TV]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cable_TV|Cable TV]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=hedgehogMST|Hedgehog Minimum Spanning Tree
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=hedgehogMST|Hedgehog Minimum Spanning Tree ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=backupconnection|Backup Connection
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=backupconnection|Backup Connection ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxduplmst|New advances in gravitational waves observations
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxduplmst|New advances in gravitational waves observations ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=mstriver|Electrification of a rural area
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=mstriver|Electrification of a rural area ]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=MSTpath|Minimum Spanning Tree with Optimal A-B Connection]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=MSTpath|Minimum Spanning Tree with Optimal A-B Connection]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=clusteredMST|Minimum spanning tree in a graph with vertex potentials]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=clusteredMST|Minimum spanning tree in a graph with vertex potentials]]\\
Line 72:
Line 64:
**Number theory**\\
**Number theory**\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=generator|Linear congruential generator
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=generator|Linear congruential generator ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxperiod|Counting linear congruential generators
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxperiod|Counting linear congruential generators ]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=primitiveroots|On Certain Lehmer Generators]]\\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=primitiveroots|On Certain Lehmer Generators]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=BBSperiod|Sequence Periods of Some Blum Blum Shub Random Number Generators]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=BBSperiod|Sequence Periods of Some Blum Blum Shub Random Number Generators]]\\
**Priority queues**\\
**Priority queues**\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=sklad|Výběr nejlepších položek ve skladu]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=binomialheaps2|Building Binomial Heaps ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=binomialheaps2|Building Binomial Heaps
(ZK)
]]\\
+
**Properties of finite automata and regular language**s \\
**Properties of finite automata and regular language**s \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=dictionarynfa|Dictionary automaton
(ZK)
]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=dictionarynfa|Dictionary automaton ]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=paldistance|PAL distance
(ZK)
]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=paldistance|PAL distance ]] \\
-
[[http://cmp.felk.cvut.cz/~berezovs/algo/nfa_language/zada2.pdf|Finite and infinite languages
(ZK)
]] \\
+
[[http://cmp.felk.cvut.cz/~berezovs/algo/nfa_language/zada2.pdf|Finite and infinite languages ]] \\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=word_counter|The Word Counter]] \\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=word_counter|The Word Counter]] \\
-
[[http://cmp.felk.cvut.cz/~berezovs/algo/NFA_counter/task.pdf|The NFA Counter
(ZK)
]] \\
+
[[http://cmp.felk.cvut.cz/~berezovs/algo/NFA_counter/task.pdf|The NFA Counter ]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=identification_of_minimal_DFA|Identification of minimal DFA
(ZK)
]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=identification_of_minimal_DFA|Identification of minimal DFA ]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=incomplete_automaton|Incomplete Automaton
(ZK)
]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=incomplete_automaton|Incomplete Automaton ]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=prefixinwords|Words with given prefix
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=prefixinwords|Words with given prefix ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=automatabudwords|Bud words
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=automatabudwords|Bud words ]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=interword|Intermediate Words]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=interword|Intermediate Words]]\\
**Text searching** \\
**Text searching** \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=geny|Geny v DNA]] \\
-
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=DNA|Zjednodušené hledání v DNA]] \\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=committee|Basic Committee Work Model]] \\
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=committee|Basic Committee Work Model]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=textsearch2|Text Search
(ZK)
]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=textsearch2|Text Search ]] \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=dictionaries|Dictionaries
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=dictionaries|Dictionaries ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wagons|Trains dispatching
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wagons|Trains dispatching ]]\\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=polynomialinx|Search for a polynomial
(ZK)
]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=polynomialinx|Search for a polynomial ]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=stringfactorization|String Factorization]]\\
[[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=stringfactorization|String Factorization]]\\
[[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**
+
+
**Directed graphs** \\
+
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=hradlova_sit|CZ Hradlová síť]]\\
+
+
**Generation of various combinatorial structures**\\
+
[[https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=polymino|CZ Polymino]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=sachy|CZ Šachová koncovka]] \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=shoda|CZ Shoda stromù]] \\
+
+
**Graph searching** \\
+
[[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]]\\
+
+
**Minimum spanning trees** \\
+
[[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=pocitacova_sit|CZ Počítačová síť]]\\
+
+
**Priority queue(s)**\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=sklad|CZ Výbìr nejlepších položek ve skladu]]\\
+
+
**Text searching** \\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=geny|CZ Geny v DNA]] \\
+
[[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=DNA|CZ Zjednodušené hledání v DNA]] \\
----
----
-
**Older, less relevant problems**
+
----
+
+
+
**Older, less relevant problems
(also in Czech)
**
Minimum directed spanning tree (= optimum branching) \\
Minimum directed spanning tree (= optimum branching) \\
-
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=potrubni_posta2|Výstavba potrubní pošty]]\\
+
[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=potrubni_posta2|
CZ
Výstavba potrubní pošty]]\\
Pushdown automaton simulation \\
Pushdown automaton simulation \\
-
[[
https
://
cw
.felk.cvut.cz/
courses
/
a4m33pal
/
getdata.php?task=
automat
&item=
zadani.pdf|Zasobníkový automat]] \\
+
[[
http
://
cmp
.felk.cvut.cz/
~berezovs
/
algo
/automat
/
zadani.pdf|
CZ
Zasobníkový automat]] \\
Parsing \\
Parsing \\
-
[[
https
://
cw
.felk.cvut.cz/
courses
/
a4m33pal
/
task.php?task=
vyrazy|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.1550087409.txt.gz
· Last modified: 2019/02/13 20:50 by
berezovs