WORD SEARCH USING BOYER-MOORE ALGORITHM

PRANA, PANGESTU (2018) WORD SEARCH USING BOYER-MOORE ALGORITHM. Other thesis, Unika Soegijapranata Semarang.

[img] Text (COVER)
12.02.0107 PRANA PANGESTU.COVER.pdf

Download (551kB)
[img] Text (BAB I)
12.02.0107 PRANA PANGESTU.BAB I.pdf

Download (101kB)
[img] Text (BAB II)
12.02.0107 PRANA PANGESTU.BAB II.pdf
Restricted to Registered users only

Download (101kB)
[img] Text (BAB III)
12.02.0107 PRANA PANGESTU.BAB III.pdf

Download (99kB)
[img] Text (BAB IV)
12.02.0107 PRANA PANGESTU.BAB IV.pdf

Download (320kB)
[img] Text (BAB V)
12.02.0107 PRANA PANGESTU.BAB V.pdf

Download (694kB)
[img] Text (DAFTAR PUSTAKA)
12.02.0107 PRANA PANGESTU.DAFTAR PUSTAKA.pdf

Download (132kB)

Abstract

ABSTRACT Boyer-Moore is one of the algorithms used for the search words. Boyer- Moore algorithm is said to be one of the fastest to complete the search process said. This project aims at examining the algorithm Boyer-Moore will be coupled with a Hash Table data structure. This project will implement boyer-moore algorithm with difference data structure hash table and will be compare between native boyer-moore and sequential search. To know whether hash table is affect to make search word more be faster The end result of this program is a program that is used to compare between the Boyer-Moore Hash Table, Boyer-Moore and Sequential Search. Keyword: boyer-moore, hash table, string searching, searching, sequential search algorithm iv

Item Type: Thesis (Other)
Subjects: 000 Computer Science, Information and General Works > 005 Computer programming, programs & data > Information Systems
Divisions: Faculty of Computer Science > Department of Informatics Engineering
Depositing User: Mr Lucius Oentoeng
Date Deposited: 21 Jun 2018 04:06
Last Modified: 21 Jun 2018 04:06
URI: http://repository.unika.ac.id/id/eprint/16111

Actions (login required)

View Item View Item