Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jupiter

Pengembangan Dan Pengujian Black Box Testing Menggunakan Teknik Equivalance Partitions Pada Aplikasi Pengarsipan Surat Di Polrestabes Palembang Nurul Huda; Jemakmun; Kms. Muhammad Naufal
JUPITER (Jurnal Penelitian Ilmu dan Teknologi Komputer) Vol 15 No 1b (2023): Jupiter Edisi April 2023
Publisher : Teknik Komputer Politeknik Negeri Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5281./5359/15.jupiter.2023.04

Abstract

Activities that provide activity records and documentation of existing activities in state institutions and companies will result in correspondence management activities that are archived into documents. Archives play a crucial role in state institutions and companies because they are a source of news. The purpose of archiving is an archive that is combined into a source of information that requires fast time to deliver the required information. The purpose of developing this letter archiving application is to provide web-based mail archiving which consists of the process of managing incoming and outgoing mail and making more efficient and effective mail management reports. Extreme Programming is the technique used. The research results are presented in a web-based application that makes it easier to archive and search for information sources that are more effective, efficient, and up-to-date than the previous system. It also features archive recording and correspondence filing notifications for information retrieval and correspondence reporting.
Perbandingan Efisiensi Algoritma String Matchinng Knuth Morris Pratt Dan Algoritma Levenshtein Pada Aplikasi Pengarsipan Dan Pencarian Data Anggota Honda Megapro Club Indonesia Nurul Huda; Muhammad Khafidurrohman
JUPITER (Jurnal Penelitian Ilmu dan Teknologi Komputer) Vol 15 No 1d (2023): Jupiter Edisi April 2023
Publisher : Teknik Komputer Politeknik Negeri Sriwijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5281./6639/15.jupiter.2023.04

Abstract

The need for data maintenance is very large, especially for data that is very important, but sometimes in searching for data there are several obstacles. Some of them were errors in writing the search text, which caused the search for data to take a lot of time and even made the data not found. Several data search methods, namely KMP and Leveshtein, have their own advantages. In this study the author aims to make a comparison between the KMP and Levenshtein methods using the Experimental research method, to find out the results of which data search method works and the search process is faster, in order to provide benefits for users to make it easier to search data. The results of the study show that the performance of the Levenshtein algorithm is superior compared to the Knuth Morris Pratt algorithm, with the result that the speed and accuracy in searching for member data is 0.022 for the average search algorithm for Knuth Morris Pratt and 0.02 for the average search algorithm. levenshtein.