[[https://fel.cvut.cz/en/education/rozvrhy-ng.B231/public/html/predmety/46/85/p4685106.html|Timetable at FEE]] [[https://fel.cvut.cz/en/education/rozvrhy-ng.B231/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-1854.html|Discussion board]] ---- ===== Lectures ===== ^ Lecture ^ Date ^ Topics ^ Handouts ^ Lecturer ^ Recordings \\ WS '20/'21 ^ | **1.** | 27.9. | Asymptotic complexity recapitulation. Graph representation.| {{ :courses:b4m33pal:lectures:2011pal01.pdf | 01a}} \\ | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=5a18fd1a3781393a70b046ffb0f0b66a232487a7-1600851181752 | viewer ]] | | **2.** | 4.10. | MST problem. Union-Find problem.| {{ :courses:b4m33pal:lectures:2011pal02.pdf |01b}} \\ {{ :courses:b4m33pal:lectures:mst3.pdf |01c }} | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=5a18fd1a3781393a70b046ffb0f0b66a232487a7-1600851181752 | viewer ]] | | **3.** | 11.10. | Euler Trail. Directed graphs. Strongly Connected Components.| {{courses:a4m33pal:2012pal03.pdf|02}} | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=31b359546a1494fc93b7fdff55dacc8ed7d9776c-1601456101709 | viewer]] | | **4.** | 18.10. | Heaps: Binary, d-ary, binomial, Fibonacci. Heaps comparison. | {{ :courses:b4m33pal:lectures:pal04.pdf |03}} | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=342abfa74a581e02f40031c607b54ec49230f9a5-1602060902063|viewer]] | | **5.** | 25.10. | Isomorphism of graphs and trees. | {{ :courses:b4m33pal:lectures:pal07.pdf | 04}} \\ {{ :courses:be4m33pal:isom_notes.pdf |notes on isomorphism}} | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=2687adedc8570c8bab67a096875b095a412a3b17-1602665761727 | viewer]] | | **6.** | 1.11. | Generation and enumeration of combinatorial objects (subsets, k-element subsets, permutations). Gray codes. | {{:courses:b4m33pal:pal06.pdf| 05}} \\ {{ :courses:b4m33pal:lectures:combi_notes.pdf |poznámky}} | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=cef4e8ff2f2b9d7440e739cb3c0ccef477c612a2-1603270621554|viewer]] | | **7.** | 8.11. | Finite automata, indeterminism, regular expressions, exact pattern matching.| {{ :courses:b4m33pal:lectures:automata101.pdf | automaty, základní opáčko }} \\ {{ :courses:b4m33pal:lectures:paska08b.pdf | 06}} | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=e2f70f205fe065ceea3956433bbcabd7431908f4-1604483941489 | viewer ]] | | **8.** | 15.11. | Language operations, Approximate pattern matching with finite automata. | {{ :courses:b4m33pal:lectures:paska09.pdf | 09 }} | Berezovský | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=0ca912c7c1bbd0e47e895623ecf6e2f69934dba0-1605088741610 | viewer]] | | **9.** | 22.11. | Dictionary automata. Implementations of automata. | {{:courses:a4m33pal:paska10.pdf| 10 }} | Průša | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=9e8958ecda73ece300df558e66b1500fd94ae99b-1605693301464 | viewer]] {{ :courses:b4m33pal:lectures:pal-09-bbb.pdf | pdf}} | | **10.** | 29.11. | Random numbers properties and generators. Prime number generators. Primality tests - randomized and exact. Fast powers. Prime factoring. | {{ :courses:b4m33pal:lectures:pal07_2015.pdf | 07}} | Průša | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=51d20225cb27f29309d5ac87acee18dd014f5a19-1606297801938 | viewer]] {{ :courses:b4m33pal:lectures:pal10-bbb.pdf | pdf}} | | **11.** | 6.12. | Skip list, search trees: B, B+. | {{:courses:a4m33pal:paska11_0.pdf| 11@}} \\ {{ :courses:b4m33pal:lectures:paska11a.pdf | 11a}} \\ {{:courses:a4m33pal:paska11b.pdf| 11b }} | Průša | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=abe762e743b8d10935d8ee032415ec79fd3efd5b-1606902601680 | viewer]] {{ :courses:b4m33pal:lectures:pal11-bbb.pdf | pdf}} | | **12.** | 13.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.0/playback.html?meetingId=3a9c2e63053ac3a7105dae6655a4388c256f6301-1607507401053 | viewer]] {{ :courses:b4m33pal:lectures:pal-12-bbb.pdf | pdf}} | | **13.** | 20.12. | Searching in higher dimensions, K-D trees. | {{:courses:a4m33pal:paska13.pdf| 13 }} | Průša | [[https://bbb04.felk.cvut.cz//playback/presentation/2.0/playback.html?meetingId=6cef1817de77025c9f9eb93d5c14e10e5bf3a3ea-1608112201629|viewer]] {{ :courses:b4m33pal:lectures:pal-13-bbb.pdf | pdf}} | | **14.** | 10.1. | Trie, suffix trie, binary trie. | {{:courses:b4m33pal:paska13trie.pdf| 13-trie }} | Průša | Ad Lecture 02 -- {{ :courses:b4m33pal:lectures:dfsen.pdf | DFS with time stamp (repetition) }}. Ad Lecture 03 -- heaps {{ :courses:b4m33pal:lectures:heap_probem.pdf | update in a heap}}, {{ :courses:b4m33pal:lectures:binary_heap_py.pdf | binary heap example}}, {{ :courses:b4m33pal:lectures:binomial_heap_py.pdf | binary heap example }} Ad Lecture 04 -- {{ :courses:be4m33pal:isom_notes.pptx | notes on isomorphism}}. {{ :courses:b4m33pal:lectures:pal07smallfix.pptx | slides .pptx}}, [[https://cw.fel.cvut.cz/wiki/courses/b4m33pal/odkazy-zdroje#sagemath_displays_a_graph|online demonstration ]]. Ad Lecture 05 -- {{ :courses:b4m33pal:lectures: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 }} **ppt variants:** * 02. {{ :courses:b4m33pal:lectures:pal03.pptx | directed graph }} , {{ :courses:b4m33pal:lectures:dfsen.ppt | dfs repetititon}} * 03.{{ :courses:b4m33pal:lectures:pal04.pptx | Binary, n-ary, binomial, Fibonacci heaps }} {{ :courses:b4m33pal:lectures:binary_heap_py.ppt | binary }}, {{ :courses:b4m33pal:lectures:binomial_heap_py.ppt | binomial }}, {{ :courses:b4m33pal:lectures:heap_probem.pptx | node position in a heap}} * 05. {{ :courses:b4m33pal:lectures:combi_notes.pptx | combi_notes.pptx}}, {{ :courses:b4m33pal:lectures:pal06a.pptx | pal06a.pptx }} * 06. {{ :courses:b4m33pal:lectures:automata101.ppt | automata repetition }}, {{ :courses:b4m33pal:lectures:paska08b.pptx | 06 }} * 07. {{ :courses:b4m33pal:lectures:paska09x.pptx | 07}} * 10. {{ :courses:b4m33pal:lectures:pal07_2015.pptx | Rand. num. gener. }} * 11. {{ :courses:b4m33pal:lectures:paska11_0.ppt | Search trees repet.}}, {{ :courses:b4m33pal:lectures:paska11a.pptx | Skip list}}, {{ :courses:b4m33pal:lectures:paska11b.pptx | B and B+ search trees}} * 12. {{ :courses:b4m33pal:lectures:2011pal03a.ppt | More search tree repet. }}, {{ :courses:b4m33pal:lectures:paska12b.pptx | splay, 2-3-4 trees}}, {{ :courses:b4m33pal:lectures:2011pal03c.ppt | R-B tree }} * 13. {{ :courses:b4m33pal:lectures:paska13.pptx | K-D tree }} * 14. {{ :courses:b4m33pal:lectures:paska13trie.pptx | trie }} {{ :courses:b4m33pal:lectures:2011pal01.pptx | 01a }}, {{ :courses:b4m33pal:lectures:2011pal02.pptx | 01b }}, {{ :courses:b4m33pal:lectures:mst3.pptx | 01c }} {{ :courses:b4m33pal:lectures:pal07_2021.pptx | pal07_2021}} 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:be4m33pal:isom_notes.pptx | isomorphism notes }}. {{ :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]]