[[https://fel.cvut.cz/en/education/rozvrhy-ng.B211/public/html/predmety/46/85/p4685106.html|Timetable at FEE]] [[https://fel.cvut.cz/en/education/rozvrhy-ng.B211/public/html/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-1722.html|Discussion board]] ---- ===== Lectures ===== ^ Lecture ^ Date ^ Topics ^ Handouts ^ Lecturer ^ Recordings \\ WS '20/'21 ^ |1.| 22.9.| Asymptotic complexity recapitulation. Graph representation. MST problem. Union-Find problem. | {{:courses:b4m33pal:2011pal01.pdf|01}} \\ {{:courses:a4m33pal:2012pal02.pdf|01b}} \\ {{ :courses:be4m33pal:mst3.pdf | 01c}}|Berezovský| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/a3087119fe069ac4caa2903f84a2abdb40f24a92-1601468701878?meetingId=a3087119fe069ac4caa2903f84a2abdb40f24a92-1601468701878|viewer]] | |2.| 29.9.| Euler Trail. Directed graphs. Strongly Connected Components.| {{:courses:a4m33pal:2012pal03.pdf|02}} |Berezovský| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/58e4b2f0808d0b0c87281ffb3ec668638b9d52ed-1602073561792?meetingId=58e4b2f0808d0b0c87281ffb3ec668638b9d52ed-1602073561792|viewer]] [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/65adc01c32c248e8aa3166ebd8ded8a1a999e8c6-1602678421174?meetingId=65adc01c32c248e8aa3166ebd8ded8a1a999e8c6-1602678421174|viewer]] | |3.| 6.10.| Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison.| {{:courses:b4m33pal:2016pal04.pdf|03}} |Berezovský| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/7eccc7ee74fd965178ef00eed2b01c122013835a-1602684961397?meetingId=7eccc7ee74fd965178ef00eed2b01c122013835a-1602684961397|viewer]] | |4.| 13.10.| Isomorphism of graphs and trees.| {{:courses:a4m33pal:pal07.pdf|04}} |Berezovský| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/11fdbce98f0f344c165084917489b38bd9e6053c-1603283221342?meetingId=11fdbce98f0f344c165084917489b38bd9e6053c-1603283221342|viewer]] | |5.| 20.10.| Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes.| {{:courses:b4m33pal:pal06.pdf|05}} \\ {{ :courses:be4m33pal:combi_notes.pdf | Step-by-step notes }} | Berezovský| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/7cc8ab1da889db6aee3f190b4bae3dc846a8b1e9-1604496541714?meetingId=7cc8ab1da889db6aee3f190b4bae3dc846a8b1e9-1604496541714|viewer]] | |6.| 27.10.| Finite automata, indeterminism, regular expressions, exact pattern matching.| {{ :courses:be4m33pal:automata101.pdf | 08a}}, {{ :courses:be4m33pal:paska08b.pdf | 08b}} |Berezovský| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/e4f973f0159f05f6bb050853a8da72c433f36e39-1605101341867?meetingId=e4f973f0159f05f6bb050853a8da72c433f36e39-1605101341867|viewer]] | |7.| 3.11.| Language operations, Approximate pattern matching with finite automata.| {{:courses:a4m33pal:paska09.pdf|09}} | Berezovský| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/e4f973f0159f05f6bb050853a8da72c433f36e39-1605101341867?meetingId=e4f973f0159f05f6bb050853a8da72c433f36e39-1605101341867|viewer]] | |8.| 10.11.| Dictionary automata. Implementations of automata.| {{:courses:be4m33pal:paska10.pdf|10}} |Průša| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/fa968051e0062ea3390d10f4d703f3399dfdec5b-1605706141816?meetingId=fa968051e0062ea3390d10f4d703f3399dfdec5b-1605706141816|viewer (part 1)]] [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/536c227f61cf413a62b79c06a7db69a0fe197570-1605713041949?meetingId=536c227f61cf413a62b79c06a7db69a0fe197570-1605713041949|viewer (part 2)]]| |9.| 17.11.|//Canceled//, // State Holidays // | | | |10.| 24.11.| Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring.| {{:courses:a4m33pal:pal07_2015.pdf|06}} |Průša| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/37e072f334bc2736cd5ae8ce04531deaec8cfab0-1606310701798?meetingId=37e072f334bc2736cd5ae8ce04531deaec8cfab0-1606310701798|viewer]] | |11.| 1.12.| Skip list, search trees: B, B+.|{{:courses:a4m33pal:paska11_0.pdf|11@}} {{:courses:a4m33pal:paska11a.pdf|11a}} {{:courses:b4m33pal:paska11b.pdf|11b}} |Průša| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/847acd4abce63d37d312613253f8c49bc76ed060-1606915501345?meetingId=847acd4abce63d37d312613253f8c49bc76ed060-1606915501345|viewer]] | |12.| 8.12.| Search trees: 2-3-4, R-B, splay.| {{:courses:a4m33pal:2011pal03a.pdf|12a}} {{:courses:a4m33pal:paska12b.pdf|12b}} {{:courses:a4m33pal:2011pal03c.pdf|12c}} | Průša| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/6226451dacd4fc1cfa83b55816372c93cbde4d7f-1607520302006?meetingId=6226451dacd4fc1cfa83b55816372c93cbde4d7f-1607520302006|viewer]] | |13.| 15.12.| Searching in higher dimensions, K-D trees.| {{:courses:a4m33pal:paska13.pdf|13}} |Průša| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/db083a1ebd568e5f358303d3f175ff5a6d63be52-1608125101239?meetingId=db083a1ebd568e5f358303d3f175ff5a6d63be52-1608125101239|viewer]] | |14.| 5.1.| Trie, suffix trie, binary trie. | {{:courses:b4m33pal:paska13trie.pdf|14trie}} |Průša| [[https://bbb04.felk.cvut.cz/playback/presentation/2.3/298d6b83d5c8676599c7218aa9e3655ecde7253a-1609939501920?meetingId=298d6b83d5c8676599c7218aa9e3655ecde7253a-1609939501920|viewer]] | Lessons 03_heaps -- additional notes: {{ :courses:be4m33pal:binary_heap_py.pdf | binary heap}}, {{ :courses:be4m33pal:binomial_heap_py.pdf | binomial heap}}, {{ :courses:be4m33pal:heap_probem.pdf | updating nodes on a heap }} Lessons 04 -- {{ :courses:b4m33pal:lectures:isom_notes.pdf | isomorphism notes}} {{ :courses:b4m33pal:lectures:isom_notes.pptx | pptx }}. {{ :courses:b4m33pal:lectures:pal07smallfix.pptx | Slides .pptx}}, [[https://cw.fel.cvut.cz/wiki/courses/b4m33pal/odkazy-zdroje#sagemath_displays_a_graph|online demonstration ]]. Lessons 05 -- {{ :courses:be4m33pal:allksubs.py | allksubs.py }}, {{ :courses:b4m33pal:lectures:allperms.py | allperms.py }} , {{ :courses:b4m33pal:lectures:combi05.py | subset_ranks.py }} , {{ :courses:b4m33pal:lectures:perm05.py | permutation_ranks.p }} \\ [[https://www.geeksforgeeks.org/gray-to-binary-and-binary-to-gray-conversion/ | Gray code on GeeksForGeeks]]