Modifikasi Algoritma Sattolo Shuffle Untuk Mengacak Soal Pada Aplikasi Ujian Online
Abstract
The use of Computer-Based Testing (CBT) systems has become a popular evaluation method due to its efficiency and ability to accelerate the assessment process. However, challenges such as cheating and the similarity of question sequences among participants still frequently occur. This study aims to design and implement a modified Sattolo Shuffle algorithm with the addition of a Linear Congruential Generator (LCG) as a source of random numbers in the exam question randomization process. The Sattolo Shuffle algorithm was chosen because it produces a single cyclic permutation that ensures each question element is repositioned, reducing the potential for recurring patterns. The LCG is used to generate random indices deterministically but variably, based on specific parameters and an initial value (seed) derived from the participant’s serial number. The implementation was carried out in a web-based CBT system consisting of 50 questions in each exam session. Testing on three participants showed that the generated question sequences were completely different, with no identical orders found. Each participant received a unique combination of questions with an even distribution of question positions. Initial results demonstrate the algorithm's effectiveness in increasing question variation and preventing duplication, making it a potential solution to enhance security and fairness in CBT administration. This research is expected to contribute significantly to the development of more randomized, fair, and cheat-resistant online exam systems.
Downloads
References
M. A. Hasan, Supriadi, and Zamzami, “Implementasi Algoritma Fisher-Yates Untuk Mengacak Soal Ujian Online Penerimaan Mahasiswa Baru (Studi Kasus : Universitas Lancang Kuning Riau),” Jurnal Teknologi dan Sistem Informasi, vol. 3, no. 2, 2017, doi: 10.25077/TEKNOSI.v3i2.2017.291-298.
K. Andesa, N. Nurjayadi, H. Herwin, and T. Nasution, “Sistem Ujian Online Menggunakan Algoritma Fisher Yates Shuffle,” SATIN - Sains dan Teknologi Informasi, vol. 6, no. 2, pp. 67–74, Dec. 2020, doi: 10.33372/stn.v6i2.669.
T. Sugihartono and R. R. C. Putra, “Penerapan Algoritma Fisher Yates untuk Pengacakan Soal Pada Sistem Ujian Kompetisi Wartawan,” Infotek : Jurnal Informatika dan Teknologi, vol. 4, no. 2, pp. 238–248, 2021.
M. Risnasari, M. A. Effindi, P. Dellia, L. Cahyani, and N. Aini, “Computer Based Test Using the Fisher-Yates Shuffle and Smith Waterman Algorithm,” in International Conference on Art, Design, Education and Cultural Studies (ICADECS), KnE Social Sciences, Jun. 2021, pp. 353–360. doi: 10.18502/kss.v5i6.9224.
F. P. Juniawan and H. Hengki, “Pengacakan Soal Ujian Penerimaan Polri Menggunakan Algoritme Fisher Yates Shuffle,” Jurnal Telematika, vol. 1, no. 1, 2019.
A. Alamsyah, I. M. Shofi, and H. B. Suseno, “Prototipe Sistem Computer Based Test dengan Pengacakan Soal Menggunakan Metode Fisher-Yates Shuffle,” Jurnal Ilmu Komputer Agri-Informatika, vol. 8, no. 2, pp. 81–89, 2021.
I. Febriani, R. Ekawati, U. Supriadi, and M. I. Abdullah, “Fisher-Yates shuffle algorithm for randomization math exam on computer based-test,” in AIP Conference Proceedings, American Institute of Physics Inc., Apr. 2021. doi: 10.1063/5.0042534.
A. Prakarsa, A. A. Sunarto, and P. Prajoko, “Model Pengacakan Soal Ujian Online SMA Menggunakan Metode Linear Congruential Generator dan Fisher Yates,” Progresif: Jurnal Ilmiah Komputer, vol. 16, no. 2, pp. 133–142, 2020.
A. Suhazli, A. Atthariq, and A. Anwar, “Game Puzzle ‘Numbers in English’Berbasis Android Dengan Metode Fisher Yates Shuffle Sebagai Pengacak Potongan Gambar,” Jurnal Infomedia, vol. 2, no. 1, pp. 1–6, 2017.
N. F. Abdullah, “Pengembangan dan Pengujian Aplikasi Computer Based Test dengan Menggunakan Algoritme Fisher-Yates Shuffle sebagai Pengacakan Soal,” Journal of Computer Science an Engineering (JCSE), vol. 4, no. 1, pp. 50–60, 2023, doi: 10.36596/jcse.v4i1.695.
M. I. Pohan, E. Hariyanto, and F. Izhari, “Pengacakan Soal Ujian Online Berbasis Web Menggunakan Algoritma Knuth Shuffle Pada SMK Gelora Jaya Nusantara Medan,” Bulletin of Information Technology (BIT), vol. 3, no. 4, pp. 294–300, 2022, doi: 10.47065/bit.v3i1.
S. D. Nasution and Suginam, “Modifikasi Algoritma Fisher Yates Shuffle Menggunakan Linear Congruent Method Untuk Pembangkitan Bilangan Acak,” Jurnal Ilmu Komputer, vol. XII, no. 2, pp. 101–106, 2019.
G. Gunawan and D. Agung Prabowo, “Sistem Ujian Online Seleksi Penerimaan Mahasiswa Baru Dengan Pengacakan Soal Menggunakan Linear Congruent Method (Studi Kasus di Universitas Muhammadiyah Bengkulu),” JURNAL INFORMATIKA UPGRIS, vol. 3, no. 2, 2017.
A. Izzah and I. Mufarrihah, “Implementasi Metode Fisher Yates Shuffle Pada Computer Based Test Online Berbasis Website,” Inovate : Jurnal Ilmiah Inovasi Teknologi Informasi, vol. 8, no. 1, pp. 83–90, 2023.
D. D. A. Suprapto, “Aplikasi Smart Entrance Exam Berbasis Android dengan Algoritma Fisher-Yates,” Jurnal Sistem dan Teknologi Informasi (Justin), vol. 9, no. 1, pp. 25–32, 2020, doi: 10.26418/justin.v9i1.42416.
A. P. Syalsabella and A. Prapanca, “Perancangan Website Online Course (KitaPTN) untuk Persiapan UTBK Menggunakan Algoritma Fisher-Yates Shuffle,” Journal of Informatics and Computer Science, vol. 06, no. 02, pp. 581–588, 2024.
M. Ariandi and M. D. Ariyadi, “Penerapan Algoritma Fisher Yates Shuffle pada Game Edukasi Pembelajaran Untuk Pendidikan Anak Usia Dini (PAUD),” JURNAL MEDIA INFORMATIKA BUDIDARMA, vol. 6, no. 4, 2022, doi: 10.30865/mib.v6i4.4683.
I. Haditama, C. Slamet, and D. F. Rahman, “Implementasi Algoritma Fisher-Yates Dan Fuzzy Tsukamoto Dalam Game Kuis Tebak Nada Sunda Berbasis Android,” JOIN, vol. 1, no. 1, pp. 51–58, 2016.
S. C. Santo and N. M. S. Iswari, “Design and Development of Animal Recognition Application Using Gamification and Sattolo Shuffle Algorithm on Android Platform Case Study: Kebun Binatang Ragunan,” 46 IJNMT, vol. IV, no. 1, pp. 46–53, 2017.
S. D. Nasution, “Penerapan Algoritma Sattolo Shuffle Pada Memory Matching Game,” KETIK : Jurnal Informatika, vol. 02, no. 03, pp. 01–06, 2025.
S. C. Santo and N. M. S. Iswari, “Design and Development of Animal Recognition Application Using Gamification and Sattolo Shuffle Algorithm on Android Platform Case Study: Kebun Binatang Ragunan,” 46 IJNMT, vol. IV, no. 1, pp. 46–53, 2017.
M. Yohanna, F. G. N. Larosa, and D. F. Malau, “Aplikasi Ujian Try Out Dengan Menerapkan Algoritma Fisher Yates Shuffle,” Jurnal Teknik Informatika, vol. 14, no. 2, 2022.
S. D. Nasution, “Penerapan Algoritma Sattolo Shuffle Pada Memory Matching Game,” KETIK : Jurnal Informatika, vol. 02, no. 03, pp. 01–06, 2025.
Y. Arviansyah, N. Nurfaizah, and R. Waluyo, “Penerapan Algoritma Fisher Yates Shuffle Pada Aplikasi TOEFL Preparation Berbasis Web,” Jurnal Buana Informatika, vol. 11, no. 2, pp. 112–122, 2020.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Modifikasi Algoritma Sattolo Shuffle Untuk Mengacak Soal Pada Aplikasi Ujian Online
Pages: 720-727
Copyright (c) 2025 Surya Darma Nasution, Mesran Mesran

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).





















