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

Added on - 16 Sep 2019

  • Dissertation

    type

  • 1

    pages

  • 175

    words

  • 133

    views

  • 0

    downloads

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.txtbbfooo#### names.txtalexbobclaydougericfoo
desklib-logo
You’re reading a preview
card-image

To View Complete Document

Become a Desklib Library Member.
Subscribe to our plans

Unlock This Document