AGITAMA, TJIONG WILLIAM (2015) Greatest Common Divisor & Least Common Multiple Calculator With Simple Learning Machine. Other thesis, Prodi Teknik Informatika Unika Soegijapranata Semarang.
|
Text (COVER)
11.02.0027 Tjiong William Agitama - COVER.pdf Download (308kB) | Preview |
|
![[img]](http://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (BAB I)
11.02.0027 Tjiong William Agitama - BAB I.pdf Restricted to Registered users only Download (82kB) |
|
|
Text (BAB II)
11.02.0027 Tjiong William Agitama - BAB II.pdf Restricted to Registered users only Download (122kB) |
|
|
Text (BAB III)
11.02.0027 Tjiong William Agitama - BAB III.pdf Restricted to Registered users only Download (92kB) |
|
|
Text (BAB IV)
11.02.0027 Tjiong William Agitama - BAB IV.pdf Restricted to Registered users only Download (129kB) |
|
|
Text (BAB V)
11.02.0027 Tjiong William Agitama - BAB V.pdf Restricted to Registered users only Download (128kB) |
|
|
Text (BAB VI)
11.02.0027 Tjiong William Agitama - BAB VI.pdf Restricted to Registered users only Download (77kB) |
|
|
Text (DAFTAR PUSTAKA)
11.02.0027 Tjiong William Agitama - DAFTAR PUSTAKA.pdf Download (64kB) | Preview |
|
|
Text (LAMPIRAN)
11.02.0027 Tjiong William Agitama - LAMPIRAN.pdf Download (1MB) | Preview |
Abstract
GCD (Greatest Common Divisor) & LCM (Least Common Multiple) is an elementary school lesson. Its about to search prime number from the compared numbers then the prime number is used to search GCD & LCM. The number which have been search before will be saved into txt file. It's used as a simple learning machine. Every time user input numbers that already saved in txt file, the program will automatically take the number and the prime number and then display it to user. This program use array to store the data that required to count GCD & LCM. Because array is special, it can store many data without limit and this program needs many data. This program has several function to solve the GCD & LCM. It use PHP and HTML to count the result and to create the web design. There are 4 steps in this program. First is search the prime factor, then sort it from smallest into biggest value to make user read the prime factor easier. If it already sorted then the program will count for GCD & LCM. Result of GCD & LCM will be informed as detailed as possible include the multiple process until it found the result.
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 004 Data processing & computer science 100 Philosophy and Psychology > 150 Psychology > Learning |
| Divisions: | Faculty of Computer Science > Department of Informatics Engineering |
| Depositing User: | Mrs Christiana Sundari |
| Date Deposited: | 04 Nov 2015 08:41 |
| Last Modified: | 24 May 2023 01:57 |
| URI: | http://repository.unika.ac.id/id/eprint/5786 |
Actions (login required)
 |
View Item |
