wavl/thesis
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases 1 Wiki Activity

feat: appendix and thanks

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2022-05-18 22:59:39 +02:00
parent 4b271e8a83
commit ebe689c25d
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 13 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
thesis.tex
View file

@ -66,7 +66,7 @@
In this bachelor thesis, we demonstrate the usage of a rank for implementing balanced binary search trees and algorithms related to a specific rank-balanced tree, the weak AVL tree. In the first part of the thesis, we present commonly used balanced search trees. In the second part, we describe the rank-balanced tree, followed by a comparison to other balanced trees that can be implemented using rank, and also diagrams and pseudocodes related to the weak AVL tree. We also present an implementation of the weak AVL tree in Python, tested with property-based testing. The final part of the thesis is a web page that allows performing operations on the weak AVL tree with animations and a step-by-step walkthrough of pseudocode. In this bachelor thesis, we demonstrate the usage of a rank for implementing balanced binary search trees and algorithms related to a specific rank-balanced tree, the weak AVL tree. In the first part of the thesis, we present commonly used balanced search trees. In the second part, we describe the rank-balanced tree, followed by a comparison to other balanced trees that can be implemented using rank, and also diagrams and pseudocodes related to the weak AVL tree. We also present an implementation of the weak AVL tree in Python, tested with property-based testing. The final part of the thesis is a web page that allows performing operations on the weak AVL tree with animations and a step-by-step walkthrough of pseudocode.
}, },
thanks = {% thanks = {%
\textit{TBD} First, I would like to thank my advisor, Ivana Černá, for her support, valuable suggestions and patience during the writing of this thesis. Secondly, I want to thank my friends and family for their support. Last but not least, I would like to thank Elice and Villain Village for being in the background while I was losing my mind over web development.
}, },
bib = bibliography.bib, bib = bibliography.bib,
%% Uncomment the following line (by removing the %% at the %% Uncomment the following line (by removing the %% at the
@ -139,8 +139,18 @@
\include{visualization} \include{visualization}
\include{summary} \include{summary}
\printbibliography
\appendix %% Start the appendices. \appendix %% Start the appendices.
\chapter{An appendix} \chapter{Source code}
Here you can insert the appendices of your thesis. The source code can be found in the appendix of this thesis as \texttt{wavl.zip}. It consists of the following directories:
\begin{itemize}
\item \texttt{python}, which contains the implementation in the Python.
\item \texttt{thesis}, which contains the source code of this thesis.
\item \texttt{web}, which contains the implementation of the web page.
\end{itemize}
Contents of the \texttt{wavl.zip} is also present at \url{https://fi.muni.cz/~xfocko/wavl}.
\end{document} \end{document}