Computer Based Test Using the Fisher-Yates Shuffle and Smith Waterman Algorithm

Abstract

Tests are used to determine a person’s level of understanding of a subject. The inhibiting factors in tests are less varied questions, questions with insufficient difficulty, subjective assessments, and the length of time in their correction. This research aimed to develop a Computer Based Test (CBT) application. The type of questions in this CBT are multiple choice and essays. This CBT employs categorization of questions, randomization of the questions, and automatic assessment. Questions were categorized manually based on Bloom’s Taxonomy of a lecture. Then the randomization process was carried out using the Fisher-Yates Shuffle algorithm for each question category. The Smith Waterman algorithm was used to automatically assess the essay-type questions. The steps of the Smith Waterman algorithm were preprocessing, data comparison using Smith Waterman, and percentage similarities conversion to test scores. The results of the study showed that the CBT application was able to randomize questions using the Fisher-Yates Shuffle algorithm and automatically assess answers using the Smith Waterman algorithm. RMSE was used to measure of the accuracy of the Smith Waterman algorithm: a value of 1.86 was obtained.
 Keywords: Computer based test, assessment, Fisher-Yates Shuffle, Smith Waterman

Implementasi Algoritma Fisher-Yates Shuffle Pada Game Edukasi Sebagai Pendukung Pembelajaran Berbasis Web

“…Proses ini terus diulangi hingga semua elemen telah ditukar. Selain itu, algoritma ini juga digunakan untuk menghasilkan permutasi acak dari himpunan terhingga [8].…”

Information System Web Design For Class English Proficiency Test Using Fisher Yates Shuffle Method

“…This algorithm is a technique for randomizing, such as randomizing the arrangement of puzzles in games [9], or in multiplayer games to randomly bring up enemy objects [10]. Several other studies that use the Fisher-Yates algorithm such as [3], [5], [11], [12], and [13] giving good results in randomizing exam questions. In another research by [14] Fisher-Yates method is unbiased and used because this method has a good randomization strategy and is suitable for numerical randomization with better execution time than the naive shuffle algorithm.…”

Children’s Basic Etiquette Learning in Mobile Application

“…It can be noted that the execution used to generate random numbers, exchange, and subtraction entirely runs on space or the same place, and then do a loop or repeated n times. Therefore, it can be concluded that the Fisher-Yates Shuffle algorithm has complexity linear time or time complexity O(n) and space complexity which is more efficient because it does not require extra space and all steps are performed in the same place or array so that obtaining space complexity is constant O(1) [17]. The following step is a randomization step performed on the Fisher-Yates Shuffle algorithm with the modern method.…”