Academic literature on the topic 'Fisher-Yates Algorithm'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fisher-Yates Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Fisher-Yates Algorithm"

1

Arviansyah, Yanuar, Nurfaizah Nurfaizah, and Retno Waluyo. "Penerapan Algoritma Fisher Yates Shuffle Pada Aplikasi TOEFL Preparation Berbasis Web." Jurnal Buana Informatika 11, no. 2 (2020): 111. http://dx.doi.org/10.24002/jbi.v11i2.3622.

Full text
Abstract:
Abstract. Applying Fisher Yates Shuffle Algorithm on The Web-Based TOEFL Preparation Application. TOEFL (Test of English as a Foreign Language) in Indonesia has been using paper all this time so the questions given to participants are still the same. Therefore, an application for randomizing the TOEFL questions is needed. The algorithm for randomizing the questions used is the Fisher Yates Shuffle algorithm, which is an algorithm to generate random permutations from a finite set. The purpose of this research is to make an application of the Fisher Yates Shuffle algorithm in the web based TOEFL Preparation application in Britania Purwokerto. Britania Purwokerto is an English language course in Banyumas. The method used to develop the application is the Extreme Programming (XP) method. After testing using the black box testing method, it is concluded that the fisher yates shuffle algorithm can be applied in the web based TOEFL Preparation application for the online TOEFL test in Britania Purwokerto.Keywords: Course Institution, TOEFL, Fisher Yates Shuffle, Extreme Programming.Abstrak. Ujian TOEFL (Test of English as a Foreign Language) di Indonesia selama ini masih menggunakan paper sehingga soal yang diberikan kepada peserta tetap sama. Oleh karena itu diperlukan aplikasi untuk mengacak soal ujian TOEFL. Algoritma pengacakan soal pada aplikasi yang digunakan yaitu algoritma Fisher Yates Shuffle, yang merupakan sebuah algoritma untuk menghasilkan permutasi acak dari suatu himpunan terhingga. Tujuan penelitian ini adalah membuat aplikasi penerapan algoritma Fisher Yates Shuffle pada aplikasi TOEFL berbasis web untuk Britania Purwokerto. Britania Purwokerto merupakan lembaga kursus bahasa Inggris yang berada di Kabupaten Banyumas. Metode yang digunakan untuk mengembangkan aplikasi adalah metode Extreme Programming (XP). Setelah dilakukan pengujian mengunakan metode black box testing disimpulkan bahwa algoritma Fisher Yates Shuffle dapat diterapkan pada aplikasi TOEFL Preparation berbasis web untuk ujian online di Britania Purwokerto. Kata Kunci: Lembaga Kursus, TOEFL, Fisher Yates Shuffle, Extreme Programming (XP).
APA, Harvard, Vancouver, ISO, and other styles
2

Nurcholis, Muhammad Tofa, Arif Dwi Laksito, and Hafizh Fauzi Fathurahman. "Implementasi Algoritme Fisher Yates Shuffle untuk Pengacakan Soal Tes IQ Berbasis Android." Progresif: Jurnal Ilmiah Komputer 19, no. 1 (2023): 436. https://doi.org/10.35889/progresif.v19i1.1168.

Full text
Abstract:
<p><em>This study aims to implement the Fisher Yates Shuffle algorithm on an Android-based IQ test application to ensure random and unbiased randomization of questions. Fisher Yates Shuffle Algorithm is one of the randomization algorithms used to reduce bias and ensure good random distribution in randomizing elements in an array. The results of this study indicate that the implementation of the Fisher Yates Shuffle algorithm in an Android-based IQ test application ensures that the questions displayed to the user are always in random order, so that there is no bias in the test results. Ease of use also improves with this implementation.</em></p><p><strong><em>Keywords:</em></strong><em> Fisher Yates Shuffle Algorithm; Implementations; IQ test.</em></p><p align="center"><em> </em></p><p align="center"><strong>Abstrak</strong></p><p>Penelitian ini bertujuan untuk mengimplementasikan algoritme <em>Fisher Yates Shuffle</em> pada aplikasi tes IQ berbasis Android untuk memastikan pengacakan soal yang acak dan tidak bias. Algoritme <em>Fisher Yates Shuffle</em> merupakan salah satu algoritme pengacakan yang digunakan untuk mengurangi bias dan memastikan distribusi acak yang baik dalam pengacakan elemen dalam suatu <em>array</em>. Hasil dari penelitian ini menunjukkan bahwa implementasi algoritme <em>Fisher Yates Shuffle</em> pada aplikasi tes IQ berbasis Android memastikan bahwa soal yang ditampilkan kepada pengguna selalu dalam urutan acak, sehingga tidak ada bias dalam hasil tes. Kemudahan penggunaan juga meningkat dengan implementasi ini.</p><p><strong><em>Kata kunci</em></strong><strong><em>:</em></strong><em> Algoritme Fisher Yates Shuffle; Implementasi; Tes IQ </em></p>
APA, Harvard, Vancouver, ISO, and other styles
3

Octaviani, Hayara, Bambang Pramono, and Rizal Adi Saputra. "Perbandingan Algoritma Fisher-Yates Shuffle Dan Linear Congruent Method Pada Aplikasi Game Susun Ayat Al-Qur’an Berbasis Android." Jurnal Ilmiah Informatika 8, no. 1 (2023): 24–36. http://dx.doi.org/10.35316/jimi.v8i1.24-36.

Full text
Abstract:
A problem that is often encountered among Qur’an memorized is the inability to memorize verses randomly. Therefore, a system is needed that is able to train the memorization of the Qur'an memorization so that it is able to memorize even with the position of the scrambled verses. To randomize verse chunks, a method is needed that can generate random numbers. Among the algorithms capable of generating random numbers are the Linear Congruent Method and the Fisher-Yates Shuffle. Of the two algorithms, no more effective algorithm has been found. For this reason, a comparison will be made by applying algorithms to Android-based game applications with the puzzle genre. This study aims to build an educational game application with the puzzle genre on the arrangement of quranic verses by comparing the effectiveness of the Linear Congruent Method and Fisher-Yates Shuffle algorithms in randomizing verses in games. The game is run in an Android application. Based on the tests that have been carried out, the results show that Linear Congruent Method has a pattern in generating random numbers while the Fisher-Yates Shuffle does not require it, so it can be concluded that the Fisher-Yates Shuffle algorithm is the most effective in randomizing.
APA, Harvard, Vancouver, ISO, and other styles
4

Sugihartono, Tri, and Rendy Rian Chrisna Putra. "Penerapan Algoritma Fisher Yates untuk Pengacakan Soal Pada Sistem Ujian Kompetisi Wartawan." Infotek : Jurnal Informatika dan Teknologi 4, no. 2 (2021): 238–48. http://dx.doi.org/10.29408/jit.v4i2.3635.

Full text
Abstract:
Procedures from the company to provide competency certification for and as official evidence that the news from the journalist is credible. In the practice of implementing the Competency Test, cheating is still found during the exam, various ways / forms of cheating that occur include cooperation between journalists (test participants). These problems are overcome by integrating the competency test system, using mobile technology and web applications that have been integrated so that they are more accessible. The Fisher Yates shuffle algorithm functions as a randomization of exam questions. Each test taker always has different exam questions, both from the numbering of questions and the order of answer choices. With the implementation of the Fisher Yates Suffle Algorithm, it can reduce acts of fraud or dishonesty by journalists. In addition, with the application of the Fisher Yates shuffle algorithm, it can make it easier for agencies to provide competent employee competencies. The results of the randomization test on the first 3 questions that appeared to the respondents resulted in the conclusion that the Fisher-Yates shuffle algorithm had a 100% success rate in randomizing the order of questions that were displayed to respondents
APA, Harvard, Vancouver, ISO, and other styles
5

Kannabi, Alvien Muhammad, and Norhikmah M.Kom (SCOPUS ID: 57216417658). "Implementation of the Fisher-Yates Shuffle Game Algorithm in Learning Hijaiyah Letters." SISTEMASI 11, no. 3 (2022): 681. http://dx.doi.org/10.32520/stmsi.v11i3.2053.

Full text
Abstract:
In 2020 the Indonesian government and the world health agency (WHO) declared the Covid-19 virus a pandemic. As a result, some activities cannot be carried out offline, especially in learning activities. The government requires that learning activities be carried out online or online. The number of children who really need help to understand the learning material provided, for example, is a game which is one of the media in learning for children to make it more interesting in its delivery. With the aim of providing basic Koran education for early childhood with interactive and fun games and the application of the Fisher-Yates Shuffle algorithm in the quiz feature that is used to randomize hijaiyah letter questions. Stages of research 1). Collecting data using library studies, namely Iqra books and related research papers. 2). Game design using story board. 3). Application of the Fisher-Yates Shuffle algorithm. 4). Testing the Fisher-Yates algorithm, black box and question. The results obtained from 10 question and 96 respondents resulted in 89.5% concluding that the hijaiyah letter game uses the Android-based Construct 2 game engine. implementation of the Fisher-Yates Shuffle algorithm on the quiz feature is feasible to use.
APA, Harvard, Vancouver, ISO, and other styles
6

Hoetama, D. J. Owen, Farica Perdana Putri, and P. M. Winarno. "Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin." ULTIMA Computing 10, no. 2 (2019): 59–64. http://dx.doi.org/10.31937/sk.v10i2.1064.

Full text
Abstract:
Maze game is an interesting game and used to spend time. However, in the maze game, the level used forthis game still uses static levels. Static levels make the maze shape stay the same if we play the same level. Thus, players will quickly feel bored because it finds the same complexity. Maze generator is a static level problem solution on the maze game. This research uses Fisher-Yates Shuffle algorithm and Flood Fill algorithm to make maze generator. Fisher-Yates Shuffle algorithm is used for wall position randomization and Flood Fill algorithm to keep the maze results to remain resolved. The results of the application implementation yielded 30 mazes and were tested using the Hamming Distance algorithm, yielding that the result of the maze formed is always different. The average percentage rate difference produced 48% each time the maze was formed. The results of the maze that was formed performed perfect maze checking with the result of 83.33% percentage.
 Index Terms— Fisher-Yates Shuffle, Flood Fill, MazeGenerator, Hamming Distance
APA, Harvard, Vancouver, ISO, and other styles
7

Saputro, Nugroho Dwi. "Comparison of Fisher-Yates Shuffle and Linear Congruent Algorithms for Question Randomization." Journal of Dinda : Data Science, Information Technology, and Data Analytics 4, no. 2 (2024): 135–40. http://dx.doi.org/10.20895/dinda.v4i2.1584.

Full text
Abstract:
This research aims to compare Fisher-Yates algorithm and Linear Congruent algorithm in generating random numbers or permutations. The test is conducted using the Chi-Square method to evaluate the quality of randomness generated by both algorithms. The Chi-Square value of the shuffling results is calculated and compared with the critical value of Chi-Square at a significance level of 0.05 with a degree of freedom (df) of 4, which is 9.488. The results show that the Chi-Square value for the Fisher-Yates algorithm is 3.8 and for the Linear Congruent algorithm is 4.3, both of which are below the critical value. This indicates that there is not enough evidence to reject the Null Hypothesis (H₀), implying that the difference in randomness quality between the two algorithms is not statistically significant. Therefore, both algorithms are considered to have equivalent performance. The decision to choose one of the algorithms can be based on other considerations such as complexity and efficiency. Further research is recommended to explore the performance of the algorithms under different conditions.
APA, Harvard, Vancouver, ISO, and other styles
8

Abdi, Musta'inul, Amru Amru, Siti Fathiyya Rafiqa, and Safriadi Safriadi. "Implementasi Algoritma Fisher-Yates untuk Pengacakan Dinamis Soal TOEFL dalam Ujian Online Berbasis Web." Jurnal Nasional Komputasi dan Teknologi Informasi (JNKTI) 7, no. 5 (2024): 1286–91. https://doi.org/10.32672/jnkti.v7i5.8086.

Full text
Abstract:
Abstrak -Pengacakan soal dalam ujian online, seperti TOEFL, adalah salah satu metode penting untuk menjaga keamanan dan keadilan ujian. Penelitian ini berfokus pada implementasi Algoritma Fisher-Yates sebagai solusi untuk pengacakan dinamis soal TOEFL dalam platform ujian berbasis web. Algoritma ini dipilih karena kompleksitasnya yang rendah, yakni O(n), sehingga mampu mengacak soal dengan efisien bahkan dalam jumlah besar. Pengujian dilakukan dengan berbagai jumlah soal, mulai dari 50 hingga 1000, untuk mengukur performa waktu eksekusi pengacakan. Hasil penelitian menunjukkan bahwa waktu eksekusi pengacakan meningkat secara linier seiring bertambahnya jumlah soal, namun tetap berada dalam skala milidetik, menjadikannya sangat cepat dan efisien untuk diterapkan dalam skenario ujian real-time. Pengacakan yang dilakukan oleh algoritma ini terbukti konsisten dan efektif, menghasilkan urutan soal yang berbeda di setiap sesi ujian tanpa perubahan pada tingkat kesulitan keseluruhan. Implementasi ini dapat mencegah kecurangan dan meningkatkan keadilan antar peserta ujian. Secara keseluruhan, penelitian ini menegaskan bahwa Algoritma Fisher-Yates adalah pilihan yang tepat untuk pengacakan soal dalam ujian online berskala besar seperti TOEFL, karena mampu mengombinasikan kecepatan, efisiensi, dan keamanan dalam satu solusi yang stabil dan mudah diimplementasikan.Kata kunci: TOEFL, Fisher-Yates, Pengacakan Abstract - Randomizing questions in online exams, such as TOEFL, is crucial for ensuring exam security and fairness. This study focuses on implementing the Fisher-Yates algorithm as a solution for dynamic question randomization in web-based exam platforms. The algorithm was chosen due to its low complexity, O(n), making it efficient even for large numbers of questions. Testing was conducted with various quantities of questions, ranging from 50 to 1000, to evaluate the execution time performance. The results indicate that execution time increases linearly with the number of questions but remains within the millisecond range, demonstrating its suitability for real-time exam scenarios. The randomization performed by the algorithm proved consistent and effective, producing different question sequences for each exam session without altering the overall difficulty level. This implementation helps prevent cheating and enhances fairness among exam participants. Overall, this research underscores that the Fisher-Yates algorithm is an optimal choice for question randomization in large-scale online exams like TOEFL, as it combines speed, efficiency, and security into a stable and easily implementable solution..Keywords: TOEFL, Fisher-Yates, Randomizing
APA, Harvard, Vancouver, ISO, and other styles
9

Putra, Rendy Rian Chrisna, and Tri Sugihartono. "Penerapan Algoritma Fisher-Yates Shuffle pada Computer Based Test Ujian Sekolah di SMKN 1 Payung." MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer 18, no. 2 (2019): 276–83. http://dx.doi.org/10.30812/matrik.v18i2.399.

Full text
Abstract:
The school exam aims to measure the success of the teaching and learning process, whether students are able to accept the material taught and whether the teacher is able to provide the material properly and correctly. In the era of the current technological era, SMKN 1 Payung already uses CBT (Computer Based Test) technology in the implementation of school examinations, the advantages of using CBT are paperless, and the results of the exam can be seen immediately after the exam, the disadvantage is the possibility of students cheating like cheating can still happen. To overcome this weakness, a problem randomization algorithm is applied, namely the Fisher-Yates Shuffle algorithm. By using the Fisher-Yates Shuffle algorithm, the sequence of questions received by each student while carrying out this CBT-based school exam will be different, thereby reducing the indication of students to cheat. In the results of the study, testing is done using blackbox testing to test whether the software functionality is functioning properly. The results of the implementation and testing that are applied prove that using of the Fisher-Yates Shuffle algorithm can help overcome the weaknesses in computer-based tests (CBT) in SMKN 1 Payung.
APA, Harvard, Vancouver, ISO, and other styles
10

Priantama, Rio, and Yuda Priandani. "IMPLEMENTASI ALGORITMA FISHER YATES UNTUK PENGACAKAN SOAL PADA APLIKASI MOBILE LEARNING KUIS FIQIH BERBASIS ANDROID." NUANSA INFORMATIKA 13, no. 2 (2019): 40. http://dx.doi.org/10.25134/nuansa.v13i2.1951.

Full text
Abstract:
The conventional learning process carried out face-to-face, is less effective as a source of learning, because the focus of students' interest has now shifted to their device so that students have difficulty repeating learning material. This study aims to produce learning media based on mobile learning on the android platform which is used as a source of learning fiqh applications for students. This mobile learning application is built by applying the Fisher Yates Shuffling algorithm or commonly known as the Fisher Yates algorithm which is now widely used in the process of developing randomization applications. This randomization method is the optimal randomization method in application development, being able to randomize the amount of material about the science of jurisprudence and prevent cheating users who only memorize answers without understanding the material when the questions are fixed or not random. Applications are built using MySQL as a database designed to manage and manipulate data quickly and easily. PHP and Perl are used as scripting programming languages for the internet and collaborate on the Android platform. The system development method used is RUP (Rational Unified Process) by collecting various best practices found in the software development industry.System testing is done using a white box and black box testing shows that the Fisher Yates algorithm can be applied in the mobile learning quiz application as a randomizer about questions. User Acceptance Model (UAT) test results show that this mobile learning application can help the process of learning the science of jurisprudence as well as being a reference in seeing the ability of students to learn the science of jurisprudence. Keywords: Mobile learning, Fisher Yates Algorithm, Fiqih, MySQL, RUP, UML
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Fisher-Yates Algorithm"

1

Ravi, Renjith V., S. B. Goyal, and Chawki Djeddi. "Colour Image Encryption Based on Fisher-Yates Algorithm and Chaotic Maps." In Pattern Recognition and Artificial Intelligence. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-04112-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharma, Sangeeta, Ankush Kumar, Nishant singh Hada, Gaurav Choudhary, and Syed Mohd Kashif. "Image Encryption Algorithm Based on Timeout, Pixel Transposition and Modified Fisher-Yates Shuffling." In Advancements in Smart Computing and Information Security. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-23095-0_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Raghunandan, K. R., Shirin Nivas Nireshwalya, Sharan Sudhir, M. Shreyank Bhat, and H. M. Tanvi. "Securing Media Information Using Hybrid Transposition Using Fisher Yates Algorithm and RSA Public Key Algorithm Using Pell’s Cubic Equation." In Advances in Intelligent Systems and Computing. Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-3514-7_73.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Fisher-Yates Algorithm"

1

Revano, Teodoro F., Manuel B. Garcia, Beau Gray M. Habal, Jennifer O. Contreras, and John Benedic R. Enriquez. "Logical Guessing Riddle Mobile Gaming Application Utilizing Fisher Yates Algorithm." In 2018 IEEE 10th International Conference on Humanoid, Nanotechnology, Information Technology,Communication and Control, Environment and Management (HNICEM). IEEE, 2018. http://dx.doi.org/10.1109/hnicem.2018.8666302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tong, Kai, Jiehong Wu, Jiawei Yang, Jing Li, Junyi Zhang, and Linyue Wang. "Random placement algorithm of Military game based on Fisher-Yates." In 2021 33rd Chinese Control and Decision Conference (CCDC). IEEE, 2021. http://dx.doi.org/10.1109/ccdc52312.2021.9602548.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Febriani, Indah, Risma Ekawati, Untung Supriadi, and M. Irsyad Abdullah. "Fisher-Yates shuffle algorithm for randomization math exam on computer based-test." In THE 2ND SCIENCE AND MATHEMATICS INTERNATIONAL CONFERENCE (SMIC 2020): Transforming Research and Education of Science and Mathematics in the Digital Age. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0042534.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Alam, Shahzad, S. M. Zakariya, and Nadeem Akhtar. "Analysis of modified triple — A steganography technique using Fisher Yates algorithm." In 2014 14th International Conference on Hybrid Intelligent Systems (HIS). IEEE, 2014. http://dx.doi.org/10.1109/his.2014.7086199.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Purba, Doni El Rezen, Anirma Kandida Ginting, Alex Rikki, and Zekson Arizona Matondang. "Depth first search and Fisher yates algorithm in arithmetic operations of educational game." In INTERNATIONAL CONFERENCE OF SNIKOM 2021. AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0154365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Yusfrizal, Deny Adhar, Ulfah Indriani, Erwin Panggabean, Ahmad Sabir, and Helmi 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). IEEE, 2020. http://dx.doi.org/10.1109/icoris50180.2020.9320766.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tiatri, Sri, Alivia Fitriani Amanto, Anastasia Aurelia, et al. "Fisher-yates shuffle algorithm application to develop a visualization assistance application for learning physics in high school." In SIXTH INTERNATIONAL CONFERENCE OF MATHEMATICAL SCIENCES (ICMS 2022). AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0127617.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shokeen, Vinod, Manish Yadav, and Pramod Kumar Singhal. "Comparative Analysis of FLR Approach Based Inverse Tree and Modern Fisher-Yates Algorithm Based Random Interleavers for IDMA Systems." In 2018 8th International Conference on Cloud Computing, Data Science & Engineering (Confluence). IEEE, 2018. http://dx.doi.org/10.1109/confluence.2018.8442676.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Irfan, Mohamad, Diena Rauda Ramdhania, Irma Sovia Nita, Tedi Priatna, and Aldy Rialdy Atmadja. "Design and Build an Early Childhood Puzzle Educational Game Using the Fisher-Yates Shuffle Algorithm as an Android-Based Scrambler for Snippets." In 2020 6th International Conference on Wireless and Telematics (ICWT). IEEE, 2020. http://dx.doi.org/10.1109/icwt50448.2020.9243628.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!