|
|
Preparation of Homeworks in the Course Algorithms
Felix, Martin ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about AVL trees, which belongs to the binary search trees. Thesis contains three parts, objective of the first one is to learn student how insert nodes into AVL trees in recursive way, objective of the second part is to learn student how delete nodes from AVL trees in non-recursive way and objective of the last one is to complete student's knowledge about AVL trees . Student's results are mached with results of model solution and this evaluation establishes student's points.
|
|
|
Content Management System
Pohl, Lukáš ; Goldefus, Filip (referee) ; Květoňová, Šárka (advisor)
The aim of this work is to create a web application which is used for improving company communication, for sharing and transfer of information via the company intranet (network). Main focus is placed on the user interface itself, which should be simple, logical and user friendly for a regular user. Utility in the three most frequently used browsers (Internet Explorer, Firefox and Opera) is also required. The technologies used are PHP (OOP), JavaScript, AJAX, HTML, MySQL and web server Apache2, under the Fedora Core operation system.
|
|
|
Translation to Various Assembly Languages
Hranáč, Jan ; Goldefus, Filip (referee) ; Meduna, Alexandr (advisor)
The goal of this project is to create a compiler capable of compilation of the input language into various assemblers (by the choice of the user). This will be achieved by expandibility of the compilator by modules implementing the building of the source files of the concrete types of assembler. The compilator will serve as a generator of parts of assembler source codes to make the work of assembler programmer easier. The input language is derived from Pascal but is closer to assembler then canonical Pascal.
|
|
|
Lexical Analyzer for Multiprocesor Computers
Otáhal, Jiří ; Goldefus, Filip (referee) ; Čermák, Martin (advisor)
Aim of this thesis is to invent method, which should accelerate speed of the analysis of source texts with multiprocessor computers. For this purpose application runs multiple process in Unix system. Each undergoing process analyzes exact partition in source file and then closes itself. Outcome of this process are internal structures, which presents exact partition. Inter-code is sequentially built from the structures which are subsequently interpreted. This kind of parallel analysis achieves acceleration of speed on the contrary of typical sequential analysis.
|
|
|
Information System for Searching Traffic Relations
Čížek, Miroslav ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
The thesis is occupied with analysis, design and implementation of web information system for searching traffic relations. The main objective of this thesis was to create system, which will provide searching traffic relations with changes based on various criteria such as "the lowest distance", "the lowest price" etc. The thesis is focusing principally on database design, selection of efficient searching technique and system implementation with regard to system performance and search speed.
|
|
|
L Systems and Their Applications
Koutný, Jiří ; Goldefus, Filip (referee) ; Meduna, Alexandr (advisor)
This master thesis describes deterministic context-free L-systems and its context in procedural modeling, especially in fractal geometry, deals with rewriting technique and its usage for modeling structures similar to plants. Further it describes more complex types of L-systems, especially their context and parametric variations, and shows usage of L-systems in computer graphics and describes its usage for procedural modeling of architecture. At the end of this thesis there are described some other possibilities of usage procedural modeling with L-systems and introduced some extensions of rewriting rules, which will be subject of future research.
|
|
|
Conversions between CF Grammars and Pushdown Automata
Makovský, Benjamin ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This work suggests and solves the implementation of the transformation of context-free grammars and the conversions between context-free grammars and pushdown automata. It makes acquainted with the models used in modern theory of formal languages. In the work are indicated all algorithms necessary for transformations and mutual conversions between context-free grammars and pushdown automata. Proposed is an object representing the grammar and the automaton in the programme. Described is the assigning of definitions of grammar and of the automaton, the solution of drawing the automaton on the screen and the creation of graphical user interface of the application. The resulting programme is developed as Jawa applet which is available on public internet pages www.convertcfg.php5.cz.
|
|
|
Graph Coloring
Procházka, Lukáš ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This thesis is about graph coloring, which is assigning colors to vertices of a graph such that no two vertices, which are linked with an edge, have the same color. This problem is very computational hard, because it's NP-complete. It's also very important, because it has many practical applications. Here are described some of the heuristic algorithms, which try to solve this problem by iteratively improving the initial solution with given number of colors. Three of them have been implemented, tested on different graphs and compared considering several criteria.
|
|
|
Information System of RELAX Health Farm
Hodaň, Jan ; Goldefus, Filip (referee) ; Květoňová, Šárka (advisor)
The essay deals with creation of information system for RELAX health farm in Koprivnice. The main aim of this project is to make available information about fitness club on its website pages in order to gain customers. The system will then offer various special offers to new and current customers. Thank to the information system, various tasks in the fitness club are simplified by using automated procedures and easy access to customers' data.
|
|
|
Preparation of Homeworks in the Course Algorithms
Adámek, Tomáš ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
The main theme of this bachelor project is creating complex homework collection for subject Algorithms. First part of this project deals with problems of computer algorithm. The knowledge of the computer algorithm belongs to basic knowledge of the computer programmer. There is brief description of the algorithm and data structure. The main part of this project deals of analyzing and creating new exercises for searching patterns in the text. Pattern matching in the text is used in the wide range of computer program. The implementation of this homework gets student a new knowledge about this theme. The next part of this implementation is also creating testing homework's for verification test. Last part of this project describes design and implementation automatic system for preparing and checking of homeworks in the course Algorithms.
|
guest ::
