|
|
Longest Prefix Match Search
Chrastina, Ondřej ; Puš, Viktor (referee) ; Tobola, Jiří (advisor)
This thesis deals with the problem of an efective routing and a data clasification in computer networks, in particular searching for the longest prefix match for the internet protocol of version 6. First the algorithm, Binary Trie, Level Compressed Trie, Lulea Compressed Trie and Binary Search on Intervals, are described and then tested to find the the most suitable algorithm from the viewpoint of memory requirements and the speed of the searching.
|
|
|
Abstract Data Types for C Language
Duda, Tomáš ; Křena, Bohuslav (referee) ; Honzík, Jan M. (advisor)
This thesis deals with abstract data types in C language. There are explained abstract data types principles and operations around it. The main object of this thesis is a student scripts transcription, which is written in Pascal language, to the C language. Within all this belongs also an animated program for demonstration. This program animates operations around linear lists and is implemented in FLASH environment.
|
|
| |
|
|
System for Support of Dynamic Data Structures Learning
Trávníček, Jiří ; Grulich, Lukáš (referee) ; Křena, Bohuslav (advisor)
The main objective of this work is to design and implement an application that can be used as an aid for the education of programming essentials. Particularly, the attention focuses on the domain of dynamic data structures. The target application will be implemented with the use of web technologies so that it can be run in an ordinary WWW browser. First of all, a brief introduction recapitulates the data structures to be covered. Then the work summarizes the usable technologies available within the web browsers with the focus on the particular technology (which is DHTML) that will become the target platform. The most significant part of this work then discusses the design of the final application. This rather theoretical part is then followed by the description of the practical implementation. A short user manual is also included.
|
|
|
Abstract Data Types for C Language
Duda, Tomáš ; Křena, Bohuslav (referee) ; Honzík, Jan M. (advisor)
This thesis deals with abstract data types in C language. There are explained abstract data types principles and operations around it. The main object of this thesis is a student scripts transcription, which is written in Pascal language, to the C language. Within all this belongs also an animated program for demonstration. This program animates operations around linear lists and is implemented in FLASH environment.
|
|
|
Parity vertex colorings
Soukup, Jan ; Gregor, Petr (advisor) ; Kučera, Petr (referee)
A parity path in a vertex colouring of a graph G is a path in which every colour is used even number of times. A parity vertex colouring is a vertex colouring having no parity path. Let χp(G) be the minimal number of colours in a parity vertex colouring of G. It is known that χp(Bn) ≥ √ n where Bn is the complete binary tree with n layers. We show that the sharp inequality holds. We use this result to obtain a new bound χp(T) > 3 √ log n where T is any binary tree with n vertices. We study the complexity of computing the parity chromatic number χp(G). We show that checking whether a vertex colouring is a parity vertex colouring is coNP-complete and we design an exponential algorithm to com- pute it. Then we use Courcelle's theorem to prove the existence of a FPT algorithm checking whether χp(G) ≤ k parametrized by k and the treewidth of G. Moreover, we design our own FPT algorithm solving the problem. This algorithm runs in polynomial time whenever k and the treewidth of G is bounded. Finally, we discuss the relation of this colouring to other types of colourings, specifically unique maximum, conflict free, and parity edge colourings.
|
|
|
Longest Prefix Match Search
Chrastina, Ondřej ; Puš, Viktor (referee) ; Tobola, Jiří (advisor)
This thesis deals with the problem of an efective routing and a data clasification in computer networks, in particular searching for the longest prefix match for the internet protocol of version 6. First the algorithm, Binary Trie, Level Compressed Trie, Lulea Compressed Trie and Binary Search on Intervals, are described and then tested to find the the most suitable algorithm from the viewpoint of memory requirements and the speed of the searching.
|
|
|
System for Support of Dynamic Data Structures Learning
Trávníček, Jiří ; Grulich, Lukáš (referee) ; Křena, Bohuslav (advisor)
The main objective of this work is to design and implement an application that can be used as an aid for the education of programming essentials. Particularly, the attention focuses on the domain of dynamic data structures. The target application will be implemented with the use of web technologies so that it can be run in an ordinary WWW browser. First of all, a brief introduction recapitulates the data structures to be covered. Then the work summarizes the usable technologies available within the web browsers with the focus on the particular technology (which is DHTML) that will become the target platform. The most significant part of this work then discusses the design of the final application. This rather theoretical part is then followed by the description of the practical implementation. A short user manual is also included.
|
|
| |
guest ::
