|
|
Search Algorithms in C Language
Nejezchleb, Ivan ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
Searching in all possible forms is at the present time widely used operation not only in the subject of information technology. So the understanding and the grasp of the basic searching algorithms is necessary for everyone who wants to develop services containing searching mechanism. In my work I deal with the searching from the view of C language programmer. I will introduce basic searching algorithms and demo applications of their principles. Goal of whole work is to create study aid for easier understanding of the search subject.
|
|
|
Preparation of Homeworks in the Course Algorithms
Vrábelová, Pavla ; Techet, Jiří (referee) ; Lukáš, Roman (advisor)
This bachelor's thesis deals with a new set of exercises for a subject Algorithms. There are explained terms such as algorithm and complexity, described general properties and types of algorithms. Further, particular sort and search algorithms covered in the set of exercises are described in more details. There is explained how these algorithms work, described their complexity, category, field of use, advantages and disadvantages. Next part presents principles of a system for automated generation and rating of exercises. The implementation of particular parts of system is described in the last chapter of this paper.
|
|
|
String Searching and Rekursive Algorithms in C Language
Porč, Jiří ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
The problem of finding a specified pattern in a text is one of the most frequently used tasks in the computers field. My work deals with the problems of searching and recursive algorithms. The objective of my work is to create programs for animated demonstration of selected algorithms and rewriting of the Study supporting materials for the course Algorithms into the C language. The created demonstrational programs are dealing with the problems of searching text strings in a text and recursion.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
|
|
Techniques of Web Pages Indexing
Tužil, Jiří ; Burget, Radek (referee) ; Kunc, Michael (advisor)
This work addresses the techniques of information searching in the Internet. It describes the structure of the presented data and their conversion into information usable in searching process. It shows various approaches of PageRank, HITS and SALSA full-text algorithms, notifying about possible difficulties and inaccuracies as well as underlining the advantages of these search techniques. The work shows the design development and implementation of a sample full-text search tool.
|
|
|
Preparation of Homeworks in the Course Algorithms
Vrábelová, Pavla ; Techet, Jiří (referee) ; Lukáš, Roman (advisor)
This bachelor's thesis deals with a new set of exercises for a subject Algorithms. There are explained terms such as algorithm and complexity, described general properties and types of algorithms. Further, particular sort and search algorithms covered in the set of exercises are described in more details. There is explained how these algorithms work, described their complexity, category, field of use, advantages and disadvantages. Next part presents principles of a system for automated generation and rating of exercises. The implementation of particular parts of system is described in the last chapter of this paper.
|
|
|
Search Algorithms in C Language
Nejezchleb, Ivan ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
Searching in all possible forms is at the present time widely used operation not only in the subject of information technology. So the understanding and the grasp of the basic searching algorithms is necessary for everyone who wants to develop services containing searching mechanism. In my work I deal with the searching from the view of C language programmer. I will introduce basic searching algorithms and demo applications of their principles. Goal of whole work is to create study aid for easier understanding of the search subject.
|
|
|
Techniques of Web Pages Indexing
Tužil, Jiří ; Burget, Radek (referee) ; Kunc, Michael (advisor)
This work addresses the techniques of information searching in the Internet. It describes the structure of the presented data and their conversion into information usable in searching process. It shows various approaches of PageRank, HITS and SALSA full-text algorithms, notifying about possible difficulties and inaccuracies as well as underlining the advantages of these search techniques. The work shows the design development and implementation of a sample full-text search tool.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
|
|
String Searching and Rekursive Algorithms in C Language
Porč, Jiří ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
The problem of finding a specified pattern in a text is one of the most frequently used tasks in the computers field. My work deals with the problems of searching and recursive algorithms. The objective of my work is to create programs for animated demonstration of selected algorithms and rewriting of the Study supporting materials for the course Algorithms into the C language. The created demonstrational programs are dealing with the problems of searching text strings in a text and recursion.
|
guest ::
