prikaz prve stranice dokumenta Rješavanje problema novčića na zvijezdi
  Download
PDF 1.11 MB
undergraduate thesis
Rješavanje problema novčića na zvijezdi
2017. urn:nbn:hr:166:201595
Bekavac, Tonka
University of Split
Faculty of Science
Department of Informatics

Cite this document

Bekavac, T. (2017). Rješavanje problema novčića na zvijezdi (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:201595

Bekavac, Tonka. "Rješavanje problema novčića na zvijezdi." Undergraduate thesis, University of Split, Faculty of Science, 2017. https://urn.nsk.hr/urn:nbn:hr:166:201595

Bekavac, Tonka. "Rješavanje problema novčića na zvijezdi." Undergraduate thesis, University of Split, Faculty of Science, 2017. https://urn.nsk.hr/urn:nbn:hr:166:201595

Bekavac, T. (2017). 'Rješavanje problema novčića na zvijezdi', Undergraduate thesis, University of Split, Faculty of Science, accessed 17 April 2024, https://urn.nsk.hr/urn:nbn:hr:166:201595

Bekavac T. Rješavanje problema novčića na zvijezdi [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2017 [cited 2024 April 17] Available at: https://urn.nsk.hr/urn:nbn:hr:166:201595

T. Bekavac, "Rješavanje problema novčića na zvijezdi", Undergraduate thesis, University of Split, Faculty of Science, Split, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:166:201595

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema novčića na zvijezdi
Title (english)Solving coins on a star problem
AuthorTonka Bekavac
MentorBranko Žitko (mentor)
Committee memberBranko Žitko (predsjednik povjerenstva)
Committee memberAni Grubišić (član povjerenstva)
Committee memberDivna Krpan (član povjerenstva)
GranterUniversity of Split
Faculty of Science
(Department of Informatics)
Split
Defense date and country2017-09-20, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Poopćenje problema novčića na zvijezdi je problem pronalaska maksimalnog broja postavljenih novčića u bilo kojem neusmjerenom grafu, ne samo na zvijezdi. Pošto se rješenje problema može opisati šetnjama na grafu uz određena pravila, a graf je jedna od najčešćih matematičkih struktura za opisivanje prostora stanja, onda možemo koristiti algoritme pretraživanja. Prikazan je postupak rješavanja korištenjem algoritama pretrage. Algoritmi pretraživanja implementirani su u programskom jeziku Python. Rezultati njihovog izvršavanja su analizirani i objašnjena je složenost implementiranih algoritama.
Abstract (english)
Generalization of coins on a star problem is problem of finding maximum number of coins on any undirected graph, not only on a star. Since a problem solution can be described by the walks on the graph with certain rules and the graph is one of the most common mathematical structures for describing the state space, then we can use search algorithms. The solving process is displays using search algorithms. Search algorithms are implemented in Python. The result of their execution are analyzed and the complexity of implemented algorithms is explained.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:201595
Study programmeTitle: Computer Science
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) informatike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) icon
Created on2018-03-27 17:20:33