PENGEMBANGAN SISTEM VERIFIKASI MATA KULIAH DENGAN PARSING DATA TEXT TRANSKRIP SIAKAD PADA JURUSAN ILMU KOMPUTER

Rian, Pandu (2014) PENGEMBANGAN SISTEM VERIFIKASI MATA KULIAH DENGAN PARSING DATA TEXT TRANSKRIP SIAKAD PADA JURUSAN ILMU KOMPUTER. Other thesis, Universitas Lampung.

[img]
Preview
FIle PDF
ABSTRAK.pdf

Download (34Kb) | Preview
[img]
Preview
FIle PDF
ABSTRACT.pdf

Download (35Kb) | Preview
[img]
Preview
FIle PDF
COVER DALAM.pdf

Download (219Kb) | Preview
[img]
Preview
FIle PDF
LEMBAR PERSETUJUAN.pdf

Download (247Kb) | Preview
[img]
Preview
FIle PDF
LEMBAR PENGESAHAN.pdf

Download (236Kb) | Preview
[img]
Preview
FIle PDF
LEMBAR PERNYATAAN.pdf

Download (224Kb) | Preview
[img]
Preview
FIle PDF
RIWAYAT HIDUP.pdf

Download (25Kb) | Preview
[img]
Preview
FIle PDF
PERSEMBAHAN.pdf

Download (22Kb) | Preview
[img]
Preview
FIle PDF
MOTO.pdf

Download (142Kb) | Preview
[img]
Preview
FIle PDF
SANWACANA.pdf

Download (37Kb) | Preview
[img]
Preview
FIle PDF
DAFTAR ISI.pdf

Download (87Kb) | Preview
[img]
Preview
FIle PDF
DAFTAR GAMBAR.pdf

Download (85Kb) | Preview
[img]
Preview
FIle PDF
DAFTAR TABEL.pdf

Download (80Kb) | Preview
[img]
Preview
FIle PDF
BAB 1.pdf

Download (61Kb) | Preview
[img]
Preview
FIle PDF
BAB 2.pdf

Download (3051Kb) | Preview
[img]
Preview
FIle PDF
BAB 3.pdf

Download (3952Kb) | Preview
[img] FIle PDF
BAB 4.pdf
Restricted to Hanya pengguna terdaftar

Download (10Mb)
[img]
Preview
FIle PDF
BAB 5.pdf

Download (55Kb) | Preview
[img]
Preview
FIle PDF
DAFTAR PUSTAKA.pdf

Download (6Kb) | Preview

Abstrak

Pada penelitian ini dilakukan pengembangan sistem verifikasi mata kuliah. Hal ini bertujuan untuk mempercepat pengecekan mata kuliah dengan kurikulum yang ada pada jurusan ilmu komputer. Sistem verifikasi mata kuliah ini dikembangkan dengan metode pencarian string matching yang memiliki dua bagian metode pemrograman: exact matching dan heuristic matching. Metode pemrograman exact matching menggunakan algoritma brute force yang memiliki kekurangan karena tidak memiliki fase preprosesing. Sedangkan, Heuristic matching menggunakan algoritma n-gram similarity karena dapat melakukan pengecekan yang detail. Algoritma brute force yang digunakan dalam sistem verifikasi mata kuliah lebih cepat dalam hasil running time, namun algoritma n-gram similarity lebih efisien dalam pengecekan apabila satu karakter pada kopel dan mata kuliah dihapus. In this research, the development of verification systems courses. IT aims to accelerate the process of checking the existing curriculum in computer science majors. Course verification systems was developed with the search string matching method which has two parts programming methods: exact matching and heuristic matching. Exact matching programming method using a brute force algorithm has shortcomings because it does not have the preprocessing phase. Meanwhile, heuristic matching algorithm using n-gram similarity as it can check the detail . The results shows brute-force algorithm more quickly in running time results. But n-gram similarity algorithm is more efficient in checking if there some difference in one or more character in kopel and course.

Jenis Karya Akhir: Tesis (Other)
Subyek:
Program Studi: Fakultas MIPA > Prodi Ilmu Komputer
Pengguna Deposit: 365917 . Digilib
Date Deposited: 06 Apr 2015 04:18
Terakhir diubah: 06 Apr 2015 04:18
URI: http://digilib.unila.ac.id/id/eprint/4596

Actions (login required)

Lihat Karya Akhir Lihat Karya Akhir