Comparison of the Fisher-Yates Shuffle and the Linear Congruent Algorithm for Randomizing Questions in Nahwu Learning Multimedia

Comparison of the Fisher-Yates Shuffle and the Linear Congruent Algorithm for Randomizing Questions in Nahwu Learning Multimedia

Authors

  • Ukan Saokani Department of Informatics, UIN Sunan Gunung Djati Bandung
  • Mohamad Irfan Department of Informatics, UIN Sunan Gunung Djati Bandung
  • Dian Sa'adillah Maylawati Department of Informatics, UIN Sunan Gunung Djati Bandung
  • Rachmat Jaenal Abidin Department of Informatics, UIN Sunan Gunung Djati Bandung
  • Ichsan Taufik Department of Informatics, UIN Sunan Gunung Djati Bandung
  • Riyan Naufal Hay's Department of Information System, Universitas Serang Raya

DOI:

https://doi.org/10.15575/kjrt.v1i1.159

Keywords:

fisher yates shuffle, learning multimedia, nahwu, linear congruent method

Abstract

Nahwu Quiz is a basic Arabic learning application that can be played by the public over the age of 12 years. In the question practice menu, there are questions and 4 multiple choice questions. The user only needs to choose one of the multiple choices that the user thinks is correct/matches the question at hand. In one game, there are 5 questions. After answering all these questions, you will immediately see the score. The purpose of developing this application apart from being a medium of entertainment as well as a medium of learning and memory training for game users (users). To make this Nahwu Quiz application, the authors use the Fisher Yates Shuffle (FYS) algorithm which is used to perform the randomization function in multiple choice and the Linear Congruent Method (LCM) algorithm as a comparison. White box and black box testing were applied to see the feasibility of the program and to obtain efficiency in the comparison of randomization methods. The results of white box and black box testing on the application show that the application is feasible. with reference to the white box test results that the FYS algorithm and the LCM have the same complexity as the result of cyclomatic complexity = 2.

Downloads

Published

2023-06-01

Issue

Section

Articles
Loading...