Develop a C++ PROGRAM which will find a hidden sentence in a list of random wordsOpen this text file named shuffled_words.txt in your programIf it matters, you may presume there are an even number of words in the filePlace the contents of the file into an appropriate data structure in the following manner:Grab a pair of strings from the file (unless end of file is reached)Each string is separated by a spaceThe first string is the keyThe second string is the valueSo both the key and value are stringsPlace the key/value pair into your data structureWords are chained together such that a key will give its value like normal, but that value may also be a key in the map, which can find another value and so forthFor example... If...map["why"] = "hello"map["hello"] = "there"map["there"] = "everyone"map["everyone"] does not existThis means if I start with "why" and concatenate the map values together I get the sentence "why hello there everyone" There is only one sentence chained together in the entire text file. All other map entries are immediate dead ends. Take the giant word list, find the longest word chain as described above, and print out the sentence that chain makes. Words are chained together such that a key will give its value like normal, but that value may also be a key in the map, which can find another value and so forth. For example... If.• map["why"] = "hello"• map["hello"] = "there"o map["there"] = "everyone"• map["everyone"] does not exist• This means if I start with "why" and concatenate the map values together I get the sentence "why hello there everyone"• Here is what a graphical representation of what the data structure might look like:ECOND NATUREwhy →hellotennis → elbowchutes ladderswindowpanehello theremusic bandthere everyone.....videogamehead standwhy → chello hello there there everyonewhy hello there everyone

Open the shuffled_words.txt file and read its contents. Initialize a map object to store the…

Answered: Develop a C++ PROGRAM which will find a…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Develop a C++ PROGRAM which will find a hidden sentence in a list of random words

Open this text file named shuffled_words.txt in your program

If it matters, you may presume there are an even number of words in the file

Place the contents of the file into an appropriate data structure in the following manner:

Grab a pair of strings from the file (unless end of file is reached)
Each string is separated by a space
The first string is the key
The second string is the value
So both the key and value are strings
Place the key/value pair into your data structure

Words are chained together such that a key will give its value like normal, but that value may also be a key in the map, which can find another value and so forth

For example... If...
- map["why"] = "hello"
- map["hello"] = "there"
- map["there"] = "everyone"
- map["everyone"] does not exist
- This means if I start with "why" and concatenate the map values together I get the sentence "why hello there everyone"

There is only one sentence chained together in the entire text file.

All other map entries are immediate dead ends.

Take the giant word list, find the longest word chain as described above, and print out the sentence that chain makes.

Words are chained together such that a key will give its value like normal, but that value may also be a key in the map, which can find another value and so forth
. For example... If.
• map["why"] = "hello"
• map["hello"] = "there"
o map["there"] = "everyone"
• map["everyone"] does not exist
• This means if I start with "why" and concatenate the map values together I get the sentence "why hello there everyone"
• Here is what a graphical representation of what the data structure might look like:
ECOND NATURE
why →hello
tennis → elbow
chutes ladders
windowpane
hello there
music band
there everyone.....
videogame
head stand
why → chello hello there there everyone
why hello there everyone

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions