Not saying that these data structures are the most efficient, but one thing you could do is read the entire file into a String (would be inefficient), then search by substring. Continuously increase the size of the substring until it either didn't match the word you're looking for or you found a match. If it didn't match the word (lets say you're looking for the word PROGRAM and it says PRA) you would stop there, move the part of the text you're looking at up a few characters, and start over.
I'm not sure what examples the other posters are pointing you towards, but they will probably be the easier route. This is what I'd do if I wasn't going to look for classes and methods that make my life easier.