Open AccessImplementation of the fisher yates shuffle algorithm in the randomization of department recommendation examinations at PMB FKOM UNIKU
Author(s) -
Yati Nurhayati,
Siti Maesyaroh,
Sherly Gina Supartman,
Erlan Darmawan,
Elin Herlina
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1933/1/012008
Subject(s) - cheating , test (biology) , randomization , computer science , mathematics education , randomized controlled trial , algorithm , exact test , psychology , mathematics , medicine , statistics , social psychology , paleontology , surgery , biology
The new student admission test is a routine activity carried out by the Faculty of Computer Science, University of Kuningan every year. This activity is the start of the process of searching for qualified new student candidates. In the current system, there are interview sessions that aim to see the interests and talents of prospective students so that the majors chosen by these prospective students are right according to their interests and talents, but because they are still carried out face-to-face it results in less efficiency in terms of time. So we need an application that can provide recommendations for the right majors for prospective students of the Faculty of Computer Science, University of Kuningan efficiently. To avoid cheating in the new student admissions test, the application must be able to randomize the questions optimally by using the Fisher Yates Shuffle Algorithm. In this exam application, there are 300 multiple choice question banks that represent the competences of each department, namely questions with competency categories consisting of basic computer questions, logic, mathematics, programming languages, patterns, graphic design, business processes. The system will randomize using the fisher yates shuffle algorithm and display the randomized questions per category to the test takers. To see the level of effectiveness of the Fisher Yates Shuffle algorithm, 50 questions were randomized per category, displayed as many as 20 questions per examinee with a total of 30 iterations (for 30 exam participants). As a result, the position of the randomized questions is optimal and the time required for randomization is very efficient +0.01 seconds with the appearance rate of the most numbered questions being 3.17% so that the Fisher Yates Shuffle algorithm is one of the optimal algorithms for randomization.