Thesis Details

Algoritmy vyhledávání řetězců v textu a algoritmy rekurze v jazyce C

Bachelor's Thesis Student: Porč Jiří Academic Year: 2006/2007 Supervisor: Honzík Jan M., prof. Ing., CSc.
English title
String Searching and Rekursive Algorithms in C Language
Language
Czech
Abstract

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.

Keywords

Searching algorithms, Karp-Rabin algorithm, Knuth-Morris-Pratt algorithm, Boyer-Moore algorithm,recursion, tower of Hanoi, eight queens

Department
Degree Programme
Information Technology
Files
Status
defended, grade D
Date
11 June 2007
Reviewer
Committee
Černocký Jan, prof. Dr. Ing. (DCGM FIT BUT), předseda
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Kunovský Jiří, doc. Ing., CSc. (DITS FIT BUT), člen
Lukáš Roman, Ing., Ph.D. (DIFS FIT BUT), člen
Martinek David, Ing. (DIFS FIT BUT), člen
Sojka Petr, doc. RNDr., Ph.D. (FI MUNI), člen
Citation
PORČ, Jiří. Algoritmy vyhledávání řetězců v textu a algoritmy rekurze v jazyce C. Brno, 2007. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2007-06-11. Supervised by Honzík Jan M.. Available from: https://www.fit.vut.cz/study/thesis/5001/
BibTeX
@bachelorsthesis{FITBT5001,
    author = "Ji\v{r}\'{i} Por\v{c}",
    type = "Bachelor's thesis",
    title = "Algoritmy vyhled\'{a}v\'{a}n\'{i} \v{r}et\v{e}zc\r{u} v textu a algoritmy rekurze v jazyce C",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2007,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/5001/"
}
Back to top