Michael Cedrick F. de Jesus and Ramon Christian P. Salibio.  4  0   <br/><br/>
A further enhancement of heap-based algorithm applied boggle server /        6 
       6     
Michael Cedrick F. de Jesus and Ramon Christian P. Salibio. 
 -   
 -     
 - 95 pp.     28 cm.     
 -   
 -   
 - 
 - 
 -         .
 -     .
 -          0   .
 -         .
 -  0       .
<br/><br/>   Undergraduate Thesis: (BSCS major in Computer Studies) -  Pamantasan ng Lungsod ng Maynila, 2016. 
<br/><br/>
<br/><br/>      
<br/><br/>   5 
<br/><br/>      
<br/><br/> ABSTRACT:  	An Algorithm is an effective method that can be expressed within a finite amount of space and time and there are lots of algorithm competing in terms of complexity that can cater the most efficient in speed or in memory, this implied by any game complexity results. A heap is a specialized tree-based data structure that satisfies the heap property. In this algorithm, the highest (or lowest) priority element is always stored at the root. In other programming language, when you use the new operator to allocate memory, this memory is assigned from the heap. This research paper focuses in the heap-based algorithm applied in Boggle solvers and a methods used to enhance existing search tree algorithm is presented. This also explained how this method is used for further enhancing the existing enhance algorithm.  The proponents intent is to further enhance the heap-based algorithm to be able to optimize memory usage, to be able to filter invalid words according to rules of boggle puzzle, and to be able to generate succeeding words after producing words starting with the Qu. The researchers embedded the further enhance algorithm to an application to emphasize the positive effect; and concluded that the algorithm was far more efficient than the existing heap-based algorithm through the execution time of the heap elements. This algorithm also recommend to apply in other wide range category puzzles (board/word) such as scrabble game, chess game, etc.       
<br/><br/>      
<br/><br/><br/> <br/> <br/> <br/> <br/> <br/> <br/> 
<br/><br/><br/>5     
<br/><br/><br/> <br/>   
<br/><br/><label>ISBN: </label>  
<br/><br/><label>ISSN: </label>2 
 =   
 =   
<br/><br/><label>Standard No.: </label>        
<br/><br/><label>Publisher. No.: </label>  
<br/><br/><label>Source: </label>        
<br/><br/><label>LCCN: </label>
<br/><br/><label>Nat. Bib. No.: </label> 2 
<br/><br/><label>Nat. Bib. Agency Control No.: </label>    
<br/><br/><label>Subjects--Personal Names: </label><br/>     2     --0------
<br/><br/><label>Subjects--Corporate Names: </label><br/>     6 --0-- 2 --------
<br/><br/><label>Subjects--Meeting Names: </label><br/><br/> 0    2 --
<br/><br/><label>Subjects--Uniform Titles: </label><br/>  --20------
<br/><br/><label>Subjects--Chronological Terms: </label><br/> 
<br/><br/><label>Subjects--Topical Terms: </label><br/>    --------20--
<br/><br/><label>Subjects--Geographic Terms: </label><br/>--------20--
<br/><br/><label>Index Terms--Genre/Form: </label><br/>----2
<br/><br/><label>LC Class. No.: </label> / 2 
<br/><br/><label>Dewey Class. No.: </label> / 2 
<br/><br/><label>National Agricultural Library Call No.: </label> /  
<br/><br/><label>National Library of Medicine Call No.: </label> /  
<br/><br/><label>Gov. Doc. Class. No.: </label>