Thesis Details

Příprava domácích úloh pro předmět Algoritmy

Bachelor's Thesis Student: Felix Martin Academic Year: 2007/2008 Supervisor: Lukáš Roman, Ing., Ph.D.
English title
Preparation of Homeworks in the Course Algorithms
Language
Czech
Abstract

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.

Keywords

AVL tree, self-balancing binary search tree, lookup, insertion, deletion, balancing, simple rotation, double rotation, LL rotation, RR rotation, DLR rotation, DRL rotation.

Department
Degree Programme
Information Technology
Files
Status
defended, grade B
Date
11 June 2008
Reviewer
Committee
Drábek Vladimír, doc. Ing., CSc. (DCSY FIT BUT), předseda
Kočí Radek, Ing., Ph.D. (DITS FIT BUT), člen
Kreslíková Jitka, doc. RNDr., CSc. (DIFS FIT BUT), člen
Lukáš Roman, Ing., Ph.D. (DIFS FIT BUT), člen
Pelikán Jaroslav, RNDr., Ph.D. (FI MUNI), člen
Zbořil František V., doc. Ing., CSc. (DITS FIT BUT), člen
Citation
FELIX, Martin. Příprava domácích úloh pro předmět Algoritmy. Brno, 2008. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2008-06-11. Supervised by Lukáš Roman. Available from: https://www.fit.vut.cz/study/thesis/6662/
BibTeX
@bachelorsthesis{FITBT6662,
    author = "Martin Felix",
    type = "Bachelor's thesis",
    title = "P\v{r}\'{i}prava dom\'{a}c\'{i}ch \'{u}loh pro p\v{r}edm\v{e}t Algoritmy",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2008,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/6662/"
}
Back to top