PARITTA APPLICATION ON ANDROID USING HASH TABLE

Apriliani, Devina (2013) PARITTA APPLICATION ON ANDROID USING HASH TABLE. Other thesis, Unika Soegijapranata Semarang.

[img]
Preview
Text (COVER)
10.02.0022 Devina Apriliani - COVER.pdf

Download (288kB) | Preview
[img]
Preview
Text (CHAPTER 1)
10.02.0022 Devina Apriliani - CHAPTER 1.pdf

Download (36kB) | Preview
[img] Text (CHAPTER 2)
10.02.0022 Devina Apriliani - CHAPTER 2.pdf
Restricted to Registered users only

Download (95kB)
[img]
Preview
Text (CHAPTER 3)
10.02.0022 Devina Apriliani - CHAPTER 3.pdf

Download (19kB) | Preview
[img]
Preview
Text (CHAPTER 4)
10.02.0022 Devina Apriliani - CHAPTER 4.pdf

Download (192kB) | Preview
[img]
Preview
Text (CHAPTER 5)
10.02.0022 Devina Apriliani - CHAPTER 5.pdf

Download (708kB) | Preview
[img]
Preview
Text (CHAPTER 6)
10.02.0022 Devina Apriliani - CHAPTER 6.pdf

Download (15kB) | Preview
[img]
Preview
Text (REFERENCES)
10.02.0022 Devina Apriliani - REFERENCES.pdf

Download (11kB) | Preview

Abstract

Paritta Chanting Book is a book that contain many sutras from the basic teachings of the Buddha. Sometimes, a huge number of sutras which recorded in only one book makes the Buddhist community must be work hard to find a sutra of a hundred sutras manually. So many sutras should be well organized by a system. It is needed a systematic program based on Android application that can organize all sutras and can give the fast response to get the data information from a data storage. That application also can be brought anywhere and can be used anytime too. This application is used to display data searching, the Indonesian word as the key of searching be stored in linked list which is consist of Pali word for the result of translating from Indonesian word. Then the result of translation from Indonesian word to Pali word will be search again to linked list of Paritta which is consist of the Paritta's title and the content of Paritta's title. The linked list itself has the advantage in the allocation of memory, so the data can be accommodated as much as we want. This application also use hash table to accelerate the search time. The hash table also can accommodate string data to match the exciting data in the linked list.

Item Type: Thesis (Other)
Subjects: 000 Computer Science, Information and General Works > 005 Computer programming, programs & data
Divisions: Faculty of Computer Science
Depositing User: Mrs Christiana Sundari
Date Deposited: 16 Oct 2018 08:14
Last Modified: 16 Oct 2018 08:14
URI: http://repository.unika.ac.id/id/eprint/17085

Actions (login required)

View Item View Item