Please enter a string for an anagram: opt Matching word opt Matching word pot Matching word top Please enter a string for an anagram: blah No matches found Requirements You must write these three functions with the exact same function signature (include case): int loadDictionary(istream &dictfile, vector& dict); Places each string in dictfile into the vector dict. Returns the number of words loaded into dict. int permute (string word, vector& dict, vector& results); Places all the permutations of word, which are found in dict into results. Returns the number of matched words found. void display (vector& results); Displays size number of strings from results. The results can be printed in any order. For words with double letters you may find that different permutations match the same word in the dictionary. For example, if you find all the permutations of the string kloo using the algorithm we've discussed you may find that the word look is found twice. The o's in kloo take turns in front. Your program should ensure that matches are unique, in other words, the results array returned from the permute function should have no duplicates.

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
icon
Related questions
Question

Please write the code for the loadDictionarypermute, and display functions. Will thumbs up if correct! :) 

Sample Runs
Here are two examples of how the program might work:
Please enter a string for an anagram: opt
Matching word opt
Matching word pot
Matching word top
Please enter a string for an anagram: blah
No matches found
Requirements
You must write these three functions with the exact same function signature (include
case):
int loadDictionary(istream &dictfile, vector<string>& dict);
Places each string in dictfile into the vector dict. Returns the number of words loaded
into dict.
int permute (string word, vector<string>& dict, vector<string>&
results);
Places all the permutations of word, which are found in dict into results. Returns the
number of matched words found.
void display (vector<string>& results);
Displays size number of strings from results. The results can be printed in any
order.
For words with double letters you may find that different permutations match the same
word in the dictionary. For example, if you find all the permutations of the string kloo
using the algorithm we've discussed you may find that the word look is found twice. The
o's in kloo take turns in front. Your program should ensure that matches are unique, in
other words, the results array returned from the permute function should have no
duplicates.
Transcribed Image Text:Sample Runs Here are two examples of how the program might work: Please enter a string for an anagram: opt Matching word opt Matching word pot Matching word top Please enter a string for an anagram: blah No matches found Requirements You must write these three functions with the exact same function signature (include case): int loadDictionary(istream &dictfile, vector<string>& dict); Places each string in dictfile into the vector dict. Returns the number of words loaded into dict. int permute (string word, vector<string>& dict, vector<string>& results); Places all the permutations of word, which are found in dict into results. Returns the number of matched words found. void display (vector<string>& results); Displays size number of strings from results. The results can be printed in any order. For words with double letters you may find that different permutations match the same word in the dictionary. For example, if you find all the permutations of the string kloo using the algorithm we've discussed you may find that the word look is found twice. The o's in kloo take turns in front. Your program should ensure that matches are unique, in other words, the results array returned from the permute function should have no duplicates.
1
3#include <iostream>
#include <fstream>
#include <istream>
4
#include <string>
#include <vector>
using namespace std;
7
const int MAXRESULTS ▪ 20;
// Max matches that can be found
9.
const int MAXDICTWORDS = 30000; // Max words that can be read in
10
Bint loadDictionary(istream& dictfile, vector<string>& dict)
11
12
{
13
return -1; // This compiles, but this is incorrect
14
15
Bint permute(string word, vector<string>& dict, vector<string>& results)
16
17
{
18
return -1; // This compiles, but this is incorrect
19
20
Evoid display(vector<string>& results)
21
22
23
return; // This compiles, but this is incorrect
24
25
26
Bint main()
{
vector<string> results(MAXRESULTS);
vector<string> dict(MAXDICTWORDS);
ifstream dictfile;
int nwords;
27
28
29
// file containing the list of words
// number of words read from dictionary
30
31
32
string word;
33
dictfile.open("words.txt");
if (!dictfile) {
34
35
cout <« "File not found!" « endl;
return (1);
36
37
38
39
40
nwords = loadDictionary(dictfile, dict);
41
42
dictfile.close();
43
44
cout <« "Please enter a string for an anagram:
45
cin >> word;
46
int numMatches = permute (word, dict, results);
if (!numMatches)
47
48
49
cout « "No matches found" <« endl;
50
else
51
display(results);
52
53
return e;
54
Transcribed Image Text:1 3#include <iostream> #include <fstream> #include <istream> 4 #include <string> #include <vector> using namespace std; 7 const int MAXRESULTS ▪ 20; // Max matches that can be found 9. const int MAXDICTWORDS = 30000; // Max words that can be read in 10 Bint loadDictionary(istream& dictfile, vector<string>& dict) 11 12 { 13 return -1; // This compiles, but this is incorrect 14 15 Bint permute(string word, vector<string>& dict, vector<string>& results) 16 17 { 18 return -1; // This compiles, but this is incorrect 19 20 Evoid display(vector<string>& results) 21 22 23 return; // This compiles, but this is incorrect 24 25 26 Bint main() { vector<string> results(MAXRESULTS); vector<string> dict(MAXDICTWORDS); ifstream dictfile; int nwords; 27 28 29 // file containing the list of words // number of words read from dictionary 30 31 32 string word; 33 dictfile.open("words.txt"); if (!dictfile) { 34 35 cout <« "File not found!" « endl; return (1); 36 37 38 39 40 nwords = loadDictionary(dictfile, dict); 41 42 dictfile.close(); 43 44 cout <« "Please enter a string for an anagram: 45 cin >> word; 46 int numMatches = permute (word, dict, results); if (!numMatches) 47 48 49 cout « "No matches found" <« endl; 50 else 51 display(results); 52 53 return e; 54
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Array
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education