String Problems
Most languages have strings as a built in datatype, and a set of operations defined on that type. Working with these operations are important in all sorts of applications. In text editors, we might want to search through a very large document (say, a million characters) for the occurence of a given string (maybe dozens of characters). In text retrieval tools, we might potentially want to search through thousands of such documents (though normally these files would be indexed, making this unnecessary). Other applications might require string matching algorithms as part of a more complex algorithm (e.g., the Unix program diff that works out the differences between two simiar text files).
For each of the following problems, refer to the following Java class
For each of the folllowing problems, complete the code started for you using any standard text editor, then run and test them using the APT testing page within your browser.
Submitting Your Work
When you are satisfied you have completed the problems above, you should electronically submit your project through Eclipse. A submission is not considered complete unless it includes all the Java code for the project (both what you have written and the code provided when you downloaded the project) and a README file as described here.
