Thesis Details

Praktická efektivita kontejnerů

Bachelor's Thesis Student: Halámka Jan Academic Year: 2014/2015 Supervisor: Holík Lukáš, doc. Mgr., Ph.D.
English title
Practical Efficiency of Containers
Language
Czech
Abstract

This thesis is about theorethical and practical comparrison of following data containers:vector, deque, list, hash table, avl-tree, rb-tree, splay-tree, sg-tree, treap, B-tree, binomial heap, fibonacci heap, rope and skiplist while implementing sets. Asymptotic, amortized and average-case complexity for each of those structures are noted, as well as details about their implementation and description of how are they stored in computer memory. There was also created a set of tests for comparrison purposes, its results are also part of this paper.

Keywords

avl-tree, b-tree, binomial heap, container, data structure, deque, hash table, list, rb-tree, rope, scapegoat, sg-tree, skip list, splay-tree, treap, vector

Department
Department of Intelligent Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade D
Date
16 June 2015
Reviewer
Letko Zdeněk, Ing., Ph.D.
Committee
Meduna Alexander, prof. RNDr., CSc. (DIFS FIT BUT), předseda
Beran Vítězslav, doc. Ing., Ph.D. (DCGM FIT BUT), člen
Drábek Vladimír, doc. Ing., CSc. (DCSY FIT BUT), člen
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Očenášek Pavel, Mgr. Ing., Ph.D. (DIFS FIT BUT), člen
Citation
HALÁMKA, Jan. Praktická efektivita kontejnerů. Brno, 2015. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2015-06-16. Supervised by Holík Lukáš. Available from: https://www.fit.vut.cz/study/thesis/17874/
BibTeX 
@bachelorsthesis{FITBT17874,
    author = "Jan Hal\'{a}mka",
    type = "Bachelor's thesis",
    title = "Praktick\'{a} efektivita kontejner\r{u}",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2015,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/17874/"
}

Theses

Back to top