Penerapan Algoritma Sattolo Shuffle dalam Sistem Pengacakan Denah Tempat Duduk Peserta Ujian untuk Mencegah Kecurangan Akademik
-
Surya Darma Nasution
*
Sekolah Tinggi Ilmu Manajemen Sukma Medan, Medan,
Indonesia
- Guidio Leonarde Ginting Sekolah Tinggi Ilmu Manajemen Sukma Medan, Medan, Indonesia (*) Corresponding Author
Abstract
Academic cheating during examinations remains a serious problem in educational institutions. One contributing factor is the use of fixed and predictable seating arrangements, which allow exam participants to plan cheating strategies with nearby peers. This study aims to implement the Sattolo Shuffle algorithm in a seating arrangement randomization system for exam participants as a measure to prevent academic dishonesty. The Sattolo Shuffle algorithm was chosen because of its ability to generate cyclic permutations that guarantee every element moves from its original position, ensuring no exam participant occupies the same seat as in a previous exam. The study was conducted using an experimental approach involving 30 exam participants randomized using the Sattolo Shuffle algorithm. The shuffling process requires 29 iterations (n-1 iterations for n=30 elements), and the verification results show that no participant remains in their original position (0 fixed points), proving the algorithm successfully produces a perfect cyclic permutation. All 30 participants form a single cycle, confirming the derangement property of the Sattolo Shuffle algorithm
References
D. L. Mccabe, K. D. Butterfield, And L. K. Treviño, Cheating In College - Why Students Do It And What Educators Can Do About It. The Johns Hopkins University Press, 2012.
T. P. Cronan, J. K. Mullins, And D. E. Douglas, “Further Understanding Factors That Explain Freshman Business Students’ Academic Integrity Intention And Behavior: Plagiarism And Sharing Homework,” Journal Of Business Ethics, Vol. 147, No. 1, Pp. 197–220, Jan. 2018, Doi: 10.1007/S10551-015-2988-3.
W. J. Bowers, Student Dishonesty And Its Control In College. New York: Bureau Of Applied Social Research, Columbia University, 1964. [Online]. Available: Https://Eric.Ed.Gov/?Id=Ed003834
R. A. Bernardi, A. V. Baca, K. S. Landers, And M. B. Witek, “Methods Of Cheating And Deterrents To Classroom Cheating: An International Study,” Ethics Behav., Vol. 18, No. 4, Pp. 373–391, Oct. 2008, Doi: 10.1080/10508420701713030.
A. Topîrceanu, “Breaking Up Friendships In Exams: A Case Study For Minimizing Student Cheating In Higher Education Using Social Network Analysis,” Comput. Educ., Vol. 115, Pp. 171–187, Dec. 2017, Doi: 10.1016/J.Compedu.2017.08.008.
S. D. Levitt And M.-J. Lin, “Catching Cheating Students,” 2015. [Online]. Available: Http://Www.Nber.Org/Papers/W21628
I. Ajzen, “The Theory Of Planned Behavior,” 1991.
T. S. Harding, M. J. Mayhew, C. J. Finelli, And D. D. Carpenter, “The Theory Of Planned Behavior As A Model Of Academic Dishonesty In Engineering And Humanities Undergraduates,” Ethics Behav., Vol. 17, No. 3, Pp. 255–279, 2007, Doi: 10.1080/10508420701519239.
D. E. Knuth, “The Art Of Computer Programming.”
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.
S. Bulolo, “Implementasi Metode Linear Congruent Method (Lcm) Pada Simulasi Ujian Akhir Sekolah Menengah Kejuruan Lolomatua,” In Prosiding Seminar Nasional Teknologi Informatika, 2019, Pp. 60–64.
S. Sattolo, “An Algorithm To Generate A Random Cyclic Permutation,” 1986.
M. C. Wilson, “Overview Of Sattolo’s Algorithm,” 2002. [Online]. Available: Http://Algo.Inria.Fr/Seminars/.
H. Prodinger, “On The Analysis Of An Algorithm To Generate A Random Cyclic Permutation,” Ars Combinatoria, 2002.
A. Olu, “A Simulated Enhancement Of Fisher-Yates Algorithm For Shuffling In Virtual Card Games Using Domain-Specific Data Structures,” 2012.
Yusfrizal, D. Adhar, U. Indriani, E. Panggabean, A. Sabir, And H. Kurniawan, “Application Of The Fisher-Yates Shuffle Algorithm In The Game Matching The World Monument Picture,” In 2020 2nd International Conference On Cybernetics And Intelligent System, Icoris 2020, Institute Of Electrical And Electronics Engineers Inc., Oct. 2020. Doi: 10.1109/Icoris50180.2020.9320766.
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.
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,” Ijnmt (International Journal Of New Media Technology), Vol. Iv, No. 1, 2017.
S. D. Nasution And S. Suginam, “Modifikasi Algoritma Fisher Yates Shuffle Menggunakan Linear Congruent Method Untuk Pembangkitan Bilangan Acak,” Jurnal Ilmu Komputer, Vol. 12, No. 2, Pp. 101–106, 2019.
S. Angelina And A. D. Wowor, “Optimasi Pembangkit Bilangan Acak Dengan Fungsi Polinomial Dan Kombinasi Metode Iterasi,” Jiko (Jurnal Informatika Dan Komputer), Vol. 8, No. 2, P. 367, Sep. 2024, Doi: 10.26798/Jiko.V8i2.1313.
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.
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.
W. Diharjo, D. Ahkam Sani, And M. Firman Arif, “Game Edukasi Bahasa Indonesia Menggunakan Metode Fisher Yates Shuffle Pada Genre Puzzle Game,” Integer: Journal Of Information Technology, Vol. 5, No. 2, Pp. 23–35, 2020.
S. D. Nasution And G. L. Ginting, “Implementasi Algoritma Sattolo Shuffle Untuk Optimasi Pengacakan Pada Game Solitaire,” Bulletin Of Artificial Intelligence, Vol. 3, No. 2, Pp. 42–49, Oct. 2024, Doi: 10.62866/Buai.V3i2.200.
S. D. Nasution And G. L. Ginting, “Penerapan Algoritma Sattolo Shuffle Dalam Sistem Distribusi Kupon Undian Digital Pada Platform E-Commerce,” Bulletin Of Artificial Intelligence, Vol. 4, No. 1, Pp. 10–15, Apr. 2025, Doi: 10.62866/Buai.V4i1.221.
M. Hassani, “Derangements And Applications,” 2003.
H. M. Mahmoud, “Mixed Distributions In Sattolo’s Algorithm For Cyclic Permutations Via Randomization And,” J. Appl. Probab., Vol. 40, No. 3, Pp. 790–796, 2003, [Online]. Available: Http://About.Jstor.Org/Terms
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Algoritma Sattolo Shuffle dalam Sistem Pengacakan Denah Tempat Duduk Peserta Ujian untuk Mencegah Kecurangan Akademik
Pages: 51-57
Copyright (c) 2025 Surya Darma Nasution, Guidio Leonarde Ginting
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).
