Problem. 1. You have 2 files - ‘names.txt’ and ‘charact

Added on -2019-09-16

| 1 pages
| 175 words

Trusted by 2+ million users,
1000+ happy students everyday

Showing pages 1 to 1 of 1 pages

Problem1. You have 2 files - ‘names.txt’ and ‘characters.txt’.2. The `characters.txt` file contains all the characters needed to spell two names from the `names.txt` file. 3. AFTER the 2 correct names are found:* Every character from characters.txt will be used exactly once* There will be no unused charactersOther rules:* You must use Java* You must make your program very modular- with as many re-usable functions as possible.* ONCE your program has displayed and identified the two words.... The characters.txt must notcontain any unused characters. * All functions must be documented.* Use the most efficient data structures: i.e.: HashMaps, ArrayLists, LinkedLists, etc.## ExampleIn the following example, the two names would be `bob` and `foo`#### characters.txt bbfooo#### names.txt alex bob clay doug eric foo

Found this document preview useful?

You are reading a preview
Upload your documents to download
Become a Desklib member to get accesss

Students who viewed this