Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

** JAVA EXPERT NEEDED ASAP ! Read the description CAREFULLY and create a java program following the APPROACH that is mentioned . NOTE: I am

** JAVA EXPERT NEEDED ASAP !
Read the description CAREFULLY and create a java program following the APPROACH that is mentioned .
NOTE: I am unable to attach the anagram_dictionary file because it is TOO big , but I have included some screenshots below of some words the text file included (please create a txt file on your own and test it out )
Make sure to :
include comments throughout the code (i need to understand the code)
code should not be too complex
prefer Netbeans / Eclipse ( show me the output)
image text in transcribed
image text in transcribed
image text in transcribed
image text in transcribed
Assignment: Anagram solver Description: An anagram is a word / phrase that is formed by reordering the letters of another word / phrase. Below is a list of words such that the words on each line are anagrams of each other: barde, ardeb, bread, debar, beard, bared bears, saber, bares, baser, braes, sabre baste, betas, beast, tabes, beats, bates, abets caster, carets, recast, reacts, cartes, caters, traces, crates caret, crate, react, trace, cater, recta, carte Task: For this assignment, create a JAVA program that will read a dictionary from the "anagram_dictionary.txt" file (word of files that can be put into anagrams) and build a HASHMAP whose key is a sorted word (characters are sorted in alphabetical order) and whose values are the word's anagrams. Once the map is created with all the words in the dictionary, the JAVA program should enable the user to enter a word and appropriately display all the anagrams for this word. key value sorted list of word anagrams APPROACH: 1. Build a HashMap KEY: key abder (word sorted) VALUE: ArrayList 1 2. Search within HashMap . String manipulation Ultimately, the key is going to be the word a. Read word b. Sort in alphabetical order c. Look up in the hash table d. Create a new entry for it sublibrarians nard scum combining intromit mandolin helpings beacons methylcellulose alderman sturting spinach olivines autopsying equinoxes jagged outspeeded metagenesis body winning anuric scarry semiautomatically balustraded inholdings kotows neeze ginned photomurals regretfully tristfulness sceptring scaloppine querulousnesses ardour spec phenoxide unless wholenesses cruppers collaborationisms thrombi hurray unpersuasive grutch susurrous outyielding clatter accend cowardly proverbed misaver archangel molesters dutchman yogin jugulate lippies tosed deuteranopic crankest margents sexploitations transplantability perinatally glops consummators rankers tolerant inflections swoosh coordinateness plateful extensions prohibits proggins talapoins rimlands stypsis ribgrasses typhoons fragmenting dogmas upbraiders manhattans underthrusting ronyon suppliantly stiffener collinearities diploids shirkers heats indistinctnesses knackwursts leafletting pristane patronize oreganos catboats scufflers deworm

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Advances In Databases And Information Systems 23rd European Conference Adbis 2019 Bled Slovenia September 8 11 2019 Proceedings Lncs 11695

Authors: Tatjana Welzer ,Johann Eder ,Vili Podgorelec ,Aida Kamisalic Latific

1st Edition

3030287297, 978-3030287290

More Books

Students also viewed these Databases questions

Question

5. Who should facilitate the focus group?

Answered: 1 week ago