prikaz prve stranice dokumenta Euklidov algoritam za nzm u programskom jeziku C
  Download
PDF 1.09 MB
undergraduate thesis
Euklidov algoritam za nzm u programskom jeziku C
2017. urn:nbn:hr:200:979126
Kovač, Borna
Josip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
Department of Core Courses
Chair of Mathematics, Physics and Mechanical Engineering

Cite this document

Kovač, B. (2017). Euklidov algoritam za nzm u programskom jeziku C (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:200:979126

Kovač, Borna. "Euklidov algoritam za nzm u programskom jeziku C." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:979126

Kovač, Borna. "Euklidov algoritam za nzm u programskom jeziku C." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, 2017. https://urn.nsk.hr/urn:nbn:hr:200:979126

Kovač, B. (2017). 'Euklidov algoritam za nzm u programskom jeziku C', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, accessed 28 January 2021, https://urn.nsk.hr/urn:nbn:hr:200:979126

Kovač B. Euklidov algoritam za nzm u programskom jeziku C [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek; 2017 [cited 2021 January 28] Available at: https://urn.nsk.hr/urn:nbn:hr:200:979126

B. Kovač, "Euklidov algoritam za nzm u programskom jeziku C", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Faculty of Electrical Engineering, Computer Science and Information Technology Osijek, Osijek, 2017. Available at: https://urn.nsk.hr/urn:nbn:hr:200:979126

Islandora Bookmark - Please login to use this feature
Metadata
TitleEuklidov algoritam za nzm u programskom jeziku C
Title (english)Euclidean algorithm for computing the greatest common divisor in C programming language
AuthorBorna Kovač
MentorTomislav Rudec (mentor)
Committee memberTomislav Rudec (predsjednik povjerenstva)
GranterJosip Juraj Strossmayer University of Osijek
Faculty of Electrical Engineering, Computer Science and Information Technology Osijek
(Department of Core Courses)
(Chair of Mathematics, Physics and Mechanical Engineering)
Osijek
Defense date and country2017-09-27, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Process Computing
Abstract
Euklidov algoritam je najbolje i najbrže rješenje za određivanje najveće zajedničke mjere velikih brojeva i polinoma. U radu se prikazuje teorijska matematička podloga Euklidovog algoritma i njegova primjena. Napravljen je program u programskom jeziku C# u razvojnom okruženju Microsoft Visual Studio 2017 koji računa najveću zajedničku mjeru za dva cijela broja ili za 2 polinoma koristeći Euklidov algoritam, te prikazuje postupak računanja. Pri izradi programa za računanje najveće zajedničke mjere bilo je potrebno obratiti pozornost na sve različite kombinacije početnih parametara koje korisnik može unijeti. U dijelu programa koji računa cijelim brojevima bilo je potrebno omogućiti točno računanje za slučaj kada su uneseni brojevi negativni, te slučaj kada je prvi broj manji od drugog. Kod računanja polinoma trebalo je obratiti pozornost na stupnjeve prvog i drugog polinoma te napraviti program tako da se može točno izračunati najveća zajednička mjera za svaku od kombinacija.
Abstract (english)
Euclid's algorithm is the best and fastest solution for determining the greatest common divisor of large numbers and polynomials. This thesis interprets theoretical mathematics background of Euclid's algorithm and it's uses. A C# program was developed in Microsoft Visual Studio 2017 that computes the greatest common divisor of two whole numbers or two polynomials using Euclid's algorithm, and displays the computation process. When designing a program for computing the greatest common divisor, it was necessary to pay attention to all the different combinations of initial parameters that the user can enter. In the part of the program that counts whole numbers, it was necessary to enable accurate calculation in case that the input numbers are negative, and the case when the first number is smaller than the other. When calculating polynomials, attention should be paid to the degrees of the first and second polynomials and to create a program so that the greatest common divisor for the each of the combinations can be accurately calculated.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:200:979126
Study programmeTitle: Undergraduate University Study Programme
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka elektrotehnike (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka elektrotehnike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of useLicence In copyright icon
Created on2017-10-31 15:29:23