~~NOTOC~~ [[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]] ====== References ====== [**ACG**] R. Sedgewick: Algorithms in C Part 5: Graph Algorithms (3rd Edition), Addison-Wesley Professional, 2002 \\ [**HMU**] J. E. Hopcroft, R. Motwani, J. D. Ullman: Introduction to Automata Theory, Languages, and Computation, 2nd ed., Addison-Wesley, 2001 \\ [**CLRS**] T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein: Introduction to Algorithms, 2nd ed., MIT Press, 2001 \\ [**TSA**] B. Melichar et al.: Text Search Algorithms, FEE CTU, Prague, 2004 {{courses:a4m33pal:melichar-tsa-lectures-1.pdf| .pdf }} \\ In Czech:\\ [**JP**] B. Melichar: Jazyky a překlady, Praha, ČVUT 1996, in Czech \\ [**JP-LL(1)**] ke stažení: {{courses:a4m33pal:ll1.zip|LL(1) gramatiky }}, in Czech \\ [**JPc**] B. Melichar et al.: Jazyky a překlady Cvičení, Praha, ČVUT 2004, in Czech \\ [**TIS**] B. Melichar et al.: Textové informační systémy, FEL ČVUT, Praha, 1997, {{courses:a4m33pal:melichar_tis.pdf| .pdf}}, in Czech \\ [**GJA**] J. Demel: Grafy a jejich aplikace, Praha, Academia 2002, in Czech \\ ====== Other Links ====== **Many data structures** \\ [[https://www.cs.usfca.edu/~galles/visualization/Algorithms.html| Easy visualisation ]] **Graphs and graph alforithms** \\ [**TIN**] J. Kolář: Teoretická informatika, skripta, ČVUT, 2004, [[http://service.felk.cvut.cz/courses/36TI/TIN-Pred-PPT.html|Skripta TIN]], in Czech \\ **Formal languages and automata** \\ [**TJAI**] Š. Vavrečková: Teorie jazyků a automatů I, Slezská univerzita v Opavě, 2007 [[http://fpf.slu.cz/~vav10ui/formal.html|Skripta pro TJA I]], in Czech \\ [**ZST**] P. Jančar: Teoretická informatika ,VŠB-TU, Ostrava, 2007, [[http://www.cs.vsb.cz/jancar/TEORET-INF/teoret-inf.htm| Základní studijní text]], in Czech \\ [**TKA**] H. Dostál: Teorie konečných automatů, regulárních gramatik, regulárních výrazů a jazyků, Fakulta informatiky a managementu UHK, [[http://iris.uhk.cz/tein/index.html|Strukturovaná sránka]], in Czech \\ [**BGJ**] K. Stratílková: Bezkontextové gramatiky, jazyky a zásobníkové automaty, Fakulta informatiky a managementu UHK, [[http://automata.howto.cz/index.html|Strukturovaná sránka]], in Czech \\ [**AFJ**] I. Černá, M. Křetínský, A. Kučera: Automaty a formální jazyky I, Fakulta informatiky MU, 2002, [[http://is.muni.cz/elportal/?id=703389| Elektronický text]], in Czech \\ [**FJA**] B. Rovan, M. Forišek: Formálne Jazyky a Automaty, FMFI UK, Bratislava, 2009, [[http://foja.dcs.fmph.uniba.sk/materialy/skripta.pdf| Elektronické skriptá]] pre tých, ktorí preferujú štúdium v rodnej reči, in Slovak ====== Various additional sources ====== **Memory Management** \\ * CERT Coordination Center of Carnegie Mellon University on {{:courses:a4m33pal:04_dynamic_memory_v6.pdf| dynamic memory allocation }}.\\ * Doug Lea on his original Cpp [[http://g.oswego.edu/dl/html/malloc.html|Memory allocator ]].\\ * http://en.wikipedia.org/wiki/Mark-compact_algorithm * http://en.wikipedia.org/wiki/Cheney%27s_algorithm * http://en.wikipedia.org/wiki/Garbage_collection_%28computer_science%29 **Binary search** \\ * Many fail to code it correctly: [[http://reprog.wordpress.com/2010/04/19/are-you-one-of-the-10-percent/|External Link]]\\ * Even famous developers do: [[http://googleresearch.blogspot.cz/2006/06/extra-extra-read-all-about-it-nearly.html|External Link]]\\ ** Leonardo Pisano: **\\ * http://www.gdeepak.com/IADSA/L22binomialfibonacciheaps.pdf\\ * http://www.cl.cam.ac.uk/teaching/1213/AlgorithII/fibonacci.pdf\\ **Tree applets** \\ * [[http://techunix.technion.ac.il/~itai/|Splay]]\\ * [[http://webdiis.unizar.es/asignaturas/EDA/AVLTree/avltree.html|AVL a R-B]] **B+ trees** \\ * http://www.cs.princeton.edu/courses/archive/fall08/cos597A/Notes/BplusInsertDelete.pdf\\ * http://www.cs.helsinki.fi/u/mluukkai/tirak2010/B-tree.pdf\\ **k-d trees** \\ * http://www.cs.umd.edu/users/meesh/420/Notes/MountNotes/lecture17-quadkd.pdf\\ * http://www.cs.umd.edu/users/meesh/420/Notes/MountNotes/lecture18-kd2.pdf\\ * http://www.cs.umd.edu/~mount/420/Lects/420lects.pdf\\ * http://www.cs.cmu.edu/~awm/animations/kdtree/ \\ **Trie et al** \\ * http://people.cis.ksu.edu/~rhowell/viewer/viewer.html \\ * www.cs.umd.edu/class/fall2005/cmsc132/lecs/lec29.ppt \\ * www.math.tau.ac.il/~haimk/seminar02/suffixtrees.ppt\\ * www.cs.nyu.edu/~melamed/courses/102/lectures/Tries.ppt\\ ====== Programming links ====== We recommend the following publications to those hwo are interested in exercising topics from programming related to algorithms and computer sicience at intermediate and advanced levels. We will be pleased to help you with a selection based on your personal experience and interests. [**APT**] Pavel Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995, 2. vydání 2007, in Czech \\ ''A popular textbook on programming. It presents the most important data structures and their usage, basic sorting techniques, searching and graph operations. Probably, the best Czech textbook in this field, compact, for not a so high price. If it cannot be found at shops, it can be borrowed at libraries. '' \\ [**AC**] Robert Sedgewick: Algoritmy v C, části 1-4, SoftPress, Praha, 2003 \\ ''A translation of the world famous textbook. It contains details on sorting and searching. It is an excellent book with an introduction to a deeper insight to subject topics, 688 pages, the original price approx 700Kc, at present sold out. The FEE library has about 10 copies, other libraries less, but they have it. '' \\ [**ACG**] Robert Sedgewick: Algorithms in C Part 5: Graph Algorithms (3rd Edition), Addison-Wesley Professional, 2002 \\ ''Continuation of [AC]. Graph reprezentations, graph searching, shortest paths, minimum spanning trees, network flows, directed graphs. Theoretical parts can be found elsewhere, too (e.g. [GJA]). This book, similarly as [AC], stresses also important implementation issues. 528 pages. '' \\ There are two variants of the books by Prof. Sedgewick in English, for C++ and for Java. \\ [**ADSP**] Wróblewski P.: Algoritmy. Datové struktury a programovací techniky, Computer Press, Praha 2003. In Czech \\ ''This book is focused on no so advanced readers, it contains some inaccuracies and other important issues are missing. We would not recommend it as a university text book. Nevertheless, it provides a good overview and a set of typical problems. \\ Having less money, we recommend to purchase the previous publications. '' \\ **Practical programming** \\ Some training tasks might be found at: \\ a. [[http://mo.mff.cuni.cz/p/|secondary school programming championships]]. \\ b. mailing seminars related to programming, [[http://ksp.mff.cuni.cz/ |MFF UK Praha]], [[http://www.ksp.sk/ksp2.0/news/|MFF UK Bratislava]], [[http://ganymed.math.muni.cz/ks/|MU Brno]]. \\