Atmaja, Arif (2012) Anagrams Solver Using Backtracking Algorithm. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.
|
Text (COVER)
06.02.0018 Arif Atmaja COVER.pdf Download (1MB) | Preview |
|
Text (BAB I)
06.02.0018 Arif Atmaja BAB I.pdf Restricted to Registered users only Download (114kB) |
||
Text (BAB II available document only in library of Soegijapranata Catholic University)
06.02.0018 Arif Atmaja BAB II.pdf Restricted to Repository staff only Download (140kB) |
||
Text (BAB III available document only in library of Soegijapranata Catholic University)
06.02.0018 Arif Atmaja BAB III.pdf Restricted to Repository staff only Download (117kB) |
||
Text (BAB IV)
06.02.0018 Arif Atmaja BAB IV.pdf Restricted to Repository staff only Download (116kB) |
||
Text (BAB V available document only in library of Soegijapranata Catholic University)
06.02.0018 Arif Atmaja BAB V.pdf Restricted to Repository staff only Download (252kB) |
||
Text (BAB VI)
06.02.0018 Arif Atmaja BAB VI.pdf Restricted to Registered users only Download (113kB) |
||
|
Text (DAFTAR PUSTAKA)
06.02.0018 Arif Atmaja DAFTAR PUSTAKA.pdf Download (136kB) | Preview |
Abstract
Anagrams is one type of word play, in which the letters in the word input were randomized to form other words. and in this case, the authors find a solution to look for possible words formed. Backtracking algorithm is used to optimize the search process that formed the word in the dictionary. Keyword : Anagrams, Backtracking.
Item Type: | Thesis (Other) |
---|---|
Subjects: | 000 Computer Science, Information and General Works > 005 Computer programming, programs & data |
Divisions: | Faculty of Computer Science |
Depositing User: | Mr Ign. Setya Dwiana |
Date Deposited: | 16 Mar 2016 08:33 |
Last Modified: | 16 Mar 2016 08:33 |
URI: | http://repository.unika.ac.id/id/eprint/7721 |
Actions (login required)
View Item |