prikaz prve stranice dokumenta Rješavanje problema skupljanja novčića
Access restricted to students and staff of home institution
undergraduate thesis
Rješavanje problema skupljanja novčića
2019. urn:nbn:hr:166:684900
Cukrov, Marina
University of Split
Faculty of Science
Department of Informatics

Cite this document

Cukrov, M. (2019). Rješavanje problema skupljanja novčića (Undergraduate thesis). Split: University of Split, Faculty of Science. Retrieved from https://urn.nsk.hr/urn:nbn:hr:166:684900

Cukrov, Marina. "Rješavanje problema skupljanja novčića." Undergraduate thesis, University of Split, Faculty of Science, 2019. https://urn.nsk.hr/urn:nbn:hr:166:684900

Cukrov, Marina. "Rješavanje problema skupljanja novčića." Undergraduate thesis, University of Split, Faculty of Science, 2019. https://urn.nsk.hr/urn:nbn:hr:166:684900

Cukrov, M. (2019). 'Rješavanje problema skupljanja novčića', Undergraduate thesis, University of Split, Faculty of Science, accessed 20 April 2024, https://urn.nsk.hr/urn:nbn:hr:166:684900

Cukrov M. Rješavanje problema skupljanja novčića [Undergraduate thesis]. Split: University of Split, Faculty of Science; 2019 [cited 2024 April 20] Available at: https://urn.nsk.hr/urn:nbn:hr:166:684900

M. Cukrov, "Rješavanje problema skupljanja novčića", Undergraduate thesis, University of Split, Faculty of Science, Split, 2019. Available at: https://urn.nsk.hr/urn:nbn:hr:166:684900

Please login to the repository to save this object to your list.
Metadata
TitleRješavanje problema skupljanja novčića
Title (english)Solving picking up coins problem
AuthorMarina Cukrov
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 country2019-09-27, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
Problem skupljanja novčića je problem pronalaska puta kojim će robot skupiti maksimalni broj novčića novčića na ploči dimenzije nxm pri čemu su njegove kretnje ograničene na desno i dolje. Cilj ovog rada je opisati postupak rješavanja tog problema za čije smo rješavanje koristili algoritam iscrpne pretrage i dinamičko programiranje. Usporedbom ta dva algoritma smo došli do zaključka da je za rješavanje ovog problema efikasniji dinamički pristup.
Abstract (english)
The problem of picking up coins is a problem of finding the path trought which, robot will pick up the maximum number of coins on the nxm board, considering that its moves are limited to the right and to the left. The intention of this case study is to describe method of solving that problem, using brute-force algorithm and dynamic programming. Comparison of these two algorithms brought us to the conclusion that dynamic approach is much more efficient for solving this particular problem.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:166:684900
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 conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2019-12-18 13:33:20