Rancang Bangun Aplikasi Pembelajaran Baca Tulis Huruf Jawa Dengan Metode Rule Based
| Autor: | A’la Syauqi, Ainatul Mardhiyah, Puji Mahanani |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Structure (mathematical logic)
Sequence Source code Theoretical computer science Matching (graph theory) lcsh:Instruments and machines Computer science Character (computing) lcsh:Mathematics media_common.quotation_subject String searching algorithm lcsh:QA71-90 lcsh:QA1-939 lcsh:QA75.5-76.95 String Matching Brute-Force Aksara Jawa Learning Application Key (cryptography) lcsh:Q lcsh:Electronic computers. Computer science Line (text file) lcsh:Science media_common |
| Zdroj: | Matics, Vol 8, Iss 1, Pp 40-43 (2016) |
| ISSN: | 2477-2550 1978-161X |
| DOI: | 10.18860/mat.v8i1.3484 |
| Popis: | – String Matching translated as sequenceof processes that must be passed to resolve the problems infinding a pattern arrangement of character strings witheach other exactly in the same structure. Brute-ForceAlgorithm explain the concept of matching strings in a linetheory and source code. Consider the advantages anddisadvantages that exist, the expected application ofexisting theory on Brute-Force algorithm can simplify theprocess of checking the suitability of the user answers withthe answer key for building applications on the Java scriptlearning among students as the students have to pass onthe existence of java script. This application need0.003210462 second for lesson in level 1. And need0.003294419 second for lesson in level 2, 0.003478261second for lesson in level 3. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|