UNIVERSITAS BINA DARMA, UNIVERSITAS BINA DARMA (2022) RANCANG BANGUN APLIKASI UJIAN SEKOLAH MENGGUNAKAN ALGORITHMA FISHER YATES SHUFFLE. RANCANG BANGUN APLIKASI UJIAN SEKOLAH MENGGUNAKAN ALGORITHMA FISHER YATES SHUFFLE.
|
Text
conference ilkom.pdf Download (447kB) | Preview |
Abstract
Exams are one way to get results that are useful for evaluating learning and measuring the level of achievement of a teaching goal. The school exam system found at the Bina Jaya Palembang Vocational School is processing question data, student data and value data. In the process of implementing the test, an algorithm that has methods that will produce random permutations can reduce the fraud done by the examinees. The Fisher Yates Shuffle algorithm is an algorithm that produces random permutations from a finite set, in other words scrambling a set. If implemented correctly, the results of this algorithm will not be one-sided so that each permutation has the same possibility. The process carried out by the algorithm is to enter the attribute attributes into the strrat (list of questions that have not been selected), then make a range (number of questions that have not been selected), then do the randomization process, then form a roll (for a question of all the questions) the results of the selected questions are entered into the result (the results of all the questions that have been randomized). From the algorithm process carried out the results of changes in position or sequence of questions are obtained so that it is found that each exam participant who performs the exam at the same time but different questions.
| Item Type: | Article |
|---|---|
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Faculty of Engineering, Science and Mathematics > School of Electronics and Computer Science |
| Depositing User: | Mr Edi Surya Negara |
| Date Deposited: | 16 Jun 2022 01:44 |
| Last Modified: | 16 Jun 2022 01:44 |
| URI: | http://eprints.binadarma.ac.id/id/eprint/11389 |
Actions (login required)
 |
View Item |
