Data structures and efficient algorithm design in Java

Jean Bertrand Habinshuti

Bakalářská práce

Abstract:

The number of applications users has increased drastically during past years and this lead to high demand for systems to be designed efficiently in order to cope with this increase.Throughout this thesis,i have demonstrated how algorithm design can affect performance.Different approaches to solving common tasks in computer science such as searching element from a long list of elements are analyzed and based on the outcome, the best approach is selected.The implementation is done using java programming language.At the end of this thesis,a simple webpage showing the binary search tree is created.The purpose of the webpage is to allow users to see graphically how data can be arranged in such way that operations on them can be done faster. The webpage url can be found here https://bstviz.000webhostapp.com.A survey was conducted with objective to get the respondent's views on the role of focusing on efficiency as a way of dealing with high increase in application users and data volume. The results of the survey can be found in the survey part of this thesis and in the appendix.

Keywords

Algorithms, data structures, binary search tree, Big O notation, java, complexity function, linear search, binary search, efficiency, running time

Jazyk práce: angličtina

Datum vytvoření / odevzdání či podání práce: 13. 3. 2018

Obhajoba závěrečné práce

• Vedoucí: Ing. Martin Havránek, Ph.D.

Česká zemědělská univerzita v Praze

Provozně ekonomická fakulta

Bakalářský studijní program / obor:
Systems Engineering and Informatics / Informatics