Budiman, Andreas and Gunawan, Hansun and Gunawan, Dennis (2016) Implementasi Algoritma Hamming Distance dan Brute Force dalam Mendeteksi Kemiripan Source Code Bahasa Pemrograman C. Ultimatics : Jurnal Teknik Informatika, 8 (2). ISSN 2085-4552
Full text not available from this repository.Abstract
Plagiarism is a behavior that causes violence of copyrights. Survey shows 55% of college presidents say that plagiarism in students’ papers has increased over the past 10 years. Therefore, an application for detecting plagiarism is needed, especially for teachers. This plagiarism checker application is made by using Visual C# 2010. The plagiarism checker uses hamming distance algorithm for matching line code of the source code. This algorithm works by matching the same length string of the code programs. Thus, it needs brute will be matched with hamming distance. Another important thing for detecting plagiarism is the preprocessing, which is used to help the algorithm for detecting plagiarized source code. This paper shows that the application works good in detecting plagiarism, the hamming distance algorithm and brute force algorithm works better than levenstein distance algorithm for detecting structural type of plagiarism and this thesis also shows that the preprocessing could help the application to increase its percentage and its accuracy.
| Item Type: | Article |
|---|---|
| Keywords: | Brute Force, Hamming Distance, Plagiarisme, Preprocessing. |
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 005 Computer Programming |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 08 Oct 2021 02:34 |
| Last Modified: | 08 Oct 2021 02:34 |
| URI: | https://kc.umn.ac.id/id/eprint/18587 |
Actions (login required)
 |
View Item |
