RANCANG BANGUN SISTEM E-LEARNING PEMROGRAMAN PADA MODUL DETEKSI PLAGIARISME KODE PROGRAM DAN STUDENT FEEDBACK SYSTEM
Abstract
Kompetensi utama yang harus dimiliki oleh mahasiswa jurusan ilmu komputer/informatika adalah pemrograman. Perkuliahan yang berbasis pemrograman seringkali mewajibkan mahasiswa untuk mengerjakan soal yang cukup banyak. Hal ini tentunya akan menyulitkan dosen dalam mengevaluasi hasil pekerjaan mahasiswa. Selain itu, dimungkinkan pula adanya praktik mahasiswa yang memplagiat hasil dari mahasiswa lain. Penelitian ini bertujuan untuk menjawab permasalahan tersebut. Pada penelitian ini dikembangkan sebuah sistem pembelajaran/e-learning pemrograman. Modul sistem e-learning yang dibuat pada artikel ini terbatas pada modul deteksi kemiripan kode program dan student feedback system. Modul deteksi kemiripan kode program berfungsi untuk mengecek kemiripan kode program antar mahasiswa. Kemudian kode-kode program yang memiliki tingkat kemiripan tinggi akan dikelompokkan menjadi satu menggunakan algoritma hierarchical clustering. Proses pengecekan kemiripan program dimulai dari proses transformasi kode program ke dalam Abstract Syntax Tree (AST), kemudian ditransformasi menjadi sequence dan dihitung kemiripannya menggunakan algoritma Levenshtein Distance. Modul student feedback system berfungsi untuk mengecek kemiripan kode program mahasiswa dengan dosen. Mahasiswa akan mendapatkan informasi apakah kode program mereka sudah sesuai dengan yang diinginkan oleh dosen atau belum. Sebelum sistem memberikan umpan balik, terlebih dahulu kode program dosen dan mahasiswa diproses menjadi AST dan kemudian menjadi sequence. Sistem akan membandingkan kemiripan kode program dosen dan mahasiswa menggunakan algoritma Smith-Waterman yang telah dimodifikasi. Kemudian sistem menampilkan baris-baris kode mana saja yang sama antara kode program dosen dengan kode program mahasiswa. Dari hasil pengujian dapat disimpulkan bahwa modul deteksi plagiarisme dan student feedback system telah terimplementasi dengan baik.Downloads
Download data is not yet available.
References
[1] “Sphere Online Judge (SPOJ),” spoj.com. [Daring]. Tersedia pada: http://www.spoj.com/. [Diakses: 24-Jan-2017].
[2] X. Li dan X. J. Zhong, “The Source Code Plagiarism Detection Using AST,” in 2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010, hal. 406–408.
[3] E. Ayguade, J. J. Navarro, dan D. Jimenez-Gonzalez, “Smith-Waterman Algorithm.” [Daring]. Tersedia pada: http://docencia.ac.upc.edu/master/AMPP/slides/ampp_sw_presentation.pdf. [Diakses: 23-Des-2016].
[4] V. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” Cybernetics and Control Theory, vol. 10, no. 8, hal. 707–710, Feb 1966.
[5] T. Parr, The Definitive ANTLR 4 Reference, 2nd ed. The Pragmatic Programmers, 2013.
[6] T. Parr, “Parse-Tree Listeners and Visitor,” in The Definitive ANTLR 4 Reference, 2nd Edition, Pragmatic Bookshelf, 2013, hal. 17–20.
[7] “antlr/grammars-v4,” GitHub. [Daring]. Tersedia pada: https://github.com/antlr/grammars-v4. [Diakses: 23-Jan-2017].
[8] L. Rokach dan O. Maimon, “Clustering Methods,” in Data Mining and Knowledge Discovery Handbook, O. Maimon dan L. Rokach, Ed. Springer US, 2005, hal. 321–352.
[9] “Hierarchical Clustering Tutorial: Numerical example.” [Daring]. Tersedia pada: http://people.revoledu.com/kardi/tutorial/Clustering/Numerical%20Example.htm. [Diakses: 23-Jan-2017].
[10] J. E. F. Friedl, Mastering Regular Expressions, 3rd ed. O’Reilly Media, 2006.
[11] L. ping Zhang dan D. sheng Liu, “AST-based multi-language plagiarism detection method,” in Software Engineering and Service Science (ICSESS), 2013 4th IEEE International Conference on, 2013, hal. 738–742.
[2] X. Li dan X. J. Zhong, “The Source Code Plagiarism Detection Using AST,” in 2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010, hal. 406–408.
[3] E. Ayguade, J. J. Navarro, dan D. Jimenez-Gonzalez, “Smith-Waterman Algorithm.” [Daring]. Tersedia pada: http://docencia.ac.upc.edu/master/AMPP/slides/ampp_sw_presentation.pdf. [Diakses: 23-Des-2016].
[4] V. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” Cybernetics and Control Theory, vol. 10, no. 8, hal. 707–710, Feb 1966.
[5] T. Parr, The Definitive ANTLR 4 Reference, 2nd ed. The Pragmatic Programmers, 2013.
[6] T. Parr, “Parse-Tree Listeners and Visitor,” in The Definitive ANTLR 4 Reference, 2nd Edition, Pragmatic Bookshelf, 2013, hal. 17–20.
[7] “antlr/grammars-v4,” GitHub. [Daring]. Tersedia pada: https://github.com/antlr/grammars-v4. [Diakses: 23-Jan-2017].
[8] L. Rokach dan O. Maimon, “Clustering Methods,” in Data Mining and Knowledge Discovery Handbook, O. Maimon dan L. Rokach, Ed. Springer US, 2005, hal. 321–352.
[9] “Hierarchical Clustering Tutorial: Numerical example.” [Daring]. Tersedia pada: http://people.revoledu.com/kardi/tutorial/Clustering/Numerical%20Example.htm. [Diakses: 23-Jan-2017].
[10] J. E. F. Friedl, Mastering Regular Expressions, 3rd ed. O’Reilly Media, 2006.
[11] L. ping Zhang dan D. sheng Liu, “AST-based multi-language plagiarism detection method,” in Software Engineering and Service Science (ICSESS), 2013 4th IEEE International Conference on, 2013, hal. 738–742.
Published
2017-01-01
Issue
Section
Articles
License
All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in JUTI unless they receive approval for doing so from the Editor-in-Chief.
JUTI open access articles are distributed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.
How to Cite
[1]
A. Munif, R. J. Akbar, R. I. Tantra, and R. Ilavi, “RANCANG BANGUN SISTEM E-LEARNING PEMROGRAMAN PADA MODUL DETEKSI PLAGIARISME KODE PROGRAM DAN STUDENT FEEDBACK SYSTEM”, JUTI, vol. 15, no. 1, pp. 104–118, Jan. 2017, doi: 10.12962/j24068535.v15i1.a640.
