Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Implement a compression and decompression scheme that is based on Huffman
coding.
P-12.5
Create a class that implements a standard trie for a set of ASCII strings. The
class should have a constructor that takes as argument a list of strings, and the
class should have a method that tests whether a given string is stored in the trie.
P-12.6
Create a class that implements a compressed trie for a set of ASCII strings. The
class should have a constructor that takes as argument a list of strings, and the
class should have a method that tests whether a given string is stored in the trie.
P-12.7
Create a class that implements a prefix trie for an ASCII string. The class should
have a constructor that takes as argument a string and a method for pattern
matching on the string.
P-12.8
Implement the simplified search engine described in Section 12.3.4 for the
pages of a small Web site. Use all the words in the pages of the site as index
terms, excluding stop words such as articles, prepositions, and pronouns.
P-12.9
Implement a search engine for the pages of a small Web site by adding a pageranking
feature to the simplified search engine described in Section 12.3.4.
Your page-ranking feature should return the most relevant pages first. Use all
the words in the pages of the site as index terms, excluding stop words, such as
articles, prepositions, and pronouns. P-12.10 Write a program that takes two
character strings (which could be, for example, representations of DNA strands)
and computes their edit distance, showing the corresponding pieces. (See
Exercise C-12.15.)
Chapter Notes
The KMP algorithm is described by Knuth, Morris, and Pratt in their journal article
[64], and Boyer and Moore describe their algorithm in a journal article published the
same year [15]. In their article, however, Knuth et al. [64] also prove that the BM
algorithm runs in linear time. More recently, Cole [23] shows that the BM algorithm
makes at most 3n character comparisons in the worst case, and this bound is tight. All
of the algorithms discussed above are also discussed in the book chapter by Aho [3],
albeit in a more theoretical framework, including the methods for regular-expression
788