| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Podatkovna struktura intervalno drevo
Authors:Ploj, Marko (Author)
Strnad, Damjan (Mentor) More about this mentor... New window
Kohek, Štefan (Co-mentor)
Files:.pdf UN_Ploj_Marko_2017.pdf (1,54 MB)
 
Language:Slovenian
Work type:Bachelor thesis/paper (mb11)
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V diplomskem delu proučimo podatkovno strukturo intervalno drevo. Takoj za uvodom opišemo zgradbo in osnovne operacije na intervalnih drevesih. V nadaljevanju podrobneje predstavimo njihovo implementacijo in sorodne podatkovne strukture. V praktičnem delu opišemo namizno aplikacijo, s katero demonstriramo delovanje intervalnih dreves in omenimo nekatere praktične primere njihove uporabe. Na podlagi meritev izvedemo analizo časovne zahtevnosti pri različnih vhodnih podatkih.
Keywords:podatkovna struktura, intervalno drevo
Year of publishing:2017
Publisher:M. Ploj
Source:[Maribor
UDC:004.422.635(043.2)
COBISS_ID:20906006 Link is opened in a new window
NUK URN:URN:SI:UM:DK:EBU2CCTB
License:CC BY-NC-ND 4.0
This work is available under this license: Creative Commons Attribution Non-Commercial No Derivatives 4.0 International
Views:660
Downloads:69
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:The interval tree data structure
Abstract:In this thesis, we study data structure Interval tree. Right after introduction we describe structure and primary methods. In continuation, we present the implementation and similar data structures. Afterwards in practical part we describe practical desktop application that demonstrates the operation of interval trees and we mention other practical uses. In the end, based on measurements, we analyze time and memory consumption of different input data.
Keywords:data structure, interval tree


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica