Differences

This shows you the differences between two versions of the page.

--- courses:be4m33pal:problems [2018/09/19 15:07]
+++ courses:be4m33pal:problems [2018/09/19 15:07] (current)
@@ Line 1: / Line 1: @@
+[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B171/public/cz/predmety/46/85/p4685106.html|Timetable at FEE]]
+[[https://www.fel.cvut.cz/cz/education/rozvrhy-ng.B171/public/cz/paralelky/P46/85/par4685106.1.html|Students of ePAL]]
+[[https://cw.felk.cvut.cz/brute/|Upload system BRUTE]]
+[[https://cw.felk.cvut.cz/forum/forum-1442.html|Discussion board]]
+===== Theoretical problems =====
+It is recommended to concentrate mainly on the problems located approximately in the second half of each set as the first half typically contains many questions which are just simple "warm up" problems.
+{{:courses:be4m33pal:00_complexity.docx| Complexity }}\\
+{{:courses:be4m33pal:01_mst.docx| MST }}\\
+{{:courses:be4m33pal:02_directedgraphs.docx| Directed graphs}}\\
+{{:courses:be4m33pal:03_heaps.docx| Heaps}}\\
+{{:courses:be4m33pal:04_isomorphism.docx| Graph isomorphism}}\\
+{{:courses:be4m33pal:05_combinatorics.docx| Combinatorial algorithms}}\\
+{{:courses:be4m33pal:06_automata1.docx| Finite automata 1}}\\
+{{:courses:be4m33pal:07_automata2.docx| Finite automata 2}}\\
+{{:courses:be4m33pal:08_automata3.docx| Finite automata 3}}\\
+{{:courses:be4m33pal:09_numbertheory.docx| Number theory algorithms }}\\
+{{:courses:be4m33pal:10_searchtrees1.docx| Search trees 1}}\\
+{{:courses:be4m33pal:11_searchtrees2.docx| Search trees 2}}\\
+{{:courses:be4m33pal:12_searchtrees3.docx| Search trees 3}}\\
+===== Programming problems =====
+Exam programming problems from previous years are listed below.
+**Directed graphs** \\
+[[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=maxpath |Maximum path ]]\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/getdata.php?task=shortcutedges&item=desc.pdf|Shortcut edges ]]\\
+[[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 ]]\\
+[[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 ]]\\
+**Euler trail** \\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maintenance|Winter Maintenance Service]]\\
+**Generation of various combinatorial structures**\\
+[[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=counting_spanning_trees|Counting Spanning Trees ]] \\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=puzzle|The Puzzle ]] \\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/getdata.php?task=isomorphicpermutations&item=desc.pdf|Isomorphic permutations ]] \\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=segmentedbelts |Historical Segmented Belts]] \\
+**Graph isomorphism** \\
+[[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 ]]\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/getdata.php?task=similartrees&item=desc.pdf|Similar weighted binary rooted trees ]]\\
+[[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 ]]\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=networks|Connected Networks ]]\\
+**Graph searching** \\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/getdata.php?task=augmentingtrees&item=desc.pdf|Maximum Augmenting Sequence ]]\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=telescopes|Telescopes connection ]]\\
+[[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 ]]\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wordgameb|Word Game ]]\\
+**Minimum spanning tree**s \\
+[[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=campus|Campus]]\\
+[[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 ]]\\
+[[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 ]]\\
+**Number theory**\\
+[[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 ]]\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=primitiveroots|On Certain Lehmer Generators]]\\
+**Priority queues**\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=binomialheaps2|Building Binomial Heaps ]]\\
+**Properties of finite automata and regular language**s \\
+[[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 ]] \\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/getdata.php?task=nfa_language&item=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/getdata.php?task=NFA_counter&item=task.pdf|The NFA Counter ]] \\
+[[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 ]] \\
+[[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 ]]\\
+**Text searching** \\
+[[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 ]] \\
+[[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 ]]\\
+[[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=polynomialinx|Search for a polynomial ]]\\