Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
#include #include #include #include #include using namespace std; const int MAXRESULTS = 20; // Max matches that can be found const int MAXDICTWORDS = 30000; // Max words that can be read in int loadDictionary(istream& dictfile, vector& dict) /*Places each string in dictfile into the vector dict. Returns the number of words loaded into dict.*/ { return -1; // This compiles, but this is incorrect } int permute(string word, vector& dict, vector& results) /* Places al1 the permutations of word, which are found in dict into results. Returns thenumber of matched words found.*/ { return -1; // This compiles, but this is incorrect } void display (vector& results) /* Displays size number of strings from results. The results can be printed in any order.*/ { return; // This compiles, but this is incorrect } int main() { vector results(MAXRESULTS); vector dict(MAXDICTWORDS); ifstream dictfile; // file containing the list of words // number of words read from dictionary int nwords; string word; dictfile.open ("words.txt"); if (!dictfile) { cout "File ot found!" « endl; return (1); } nwords = loadDictionary(dictfile, dict); dictfile.close(); cout << "Please enter a string for an anagram: "; cin >> word; int numMatches = permute(word, dict, results); if (!numMatches) cout << "No matches found" << endl; else display(results); return 0; }|

#include #include #include #include #include using namespace std; const int MAXRESULTS = 20; // Max matches that can be found const int MAXDICTWORDS = 30000; // Max words that can be read in int loadDictionary(istream& dictfile, vector& dict) /*Places each string in dictfile into the vector dict. Returns the number of words loaded into dict.*/ { return -1; // This compiles, but this is incorrect } int permute(string word, vector& dict, vector& results) /* Places al1 the permutations of word, which are found in dict into results. Returns thenumber of matched words found.*/ { return -1; // This compiles, but this is incorrect } void display (vector& results) /* Displays size number of strings from results. The results can be printed in any order.*/ { return; // This compiles, but this is incorrect } int main() { vector results(MAXRESULTS); vector dict(MAXDICTWORDS); ifstream dictfile; // file containing the list of words // number of words read from dictionary int nwords; string word; dictfile.open ("words.txt"); if (!dictfile) { cout "File ot found!" « endl; return (1); } nwords = loadDictionary(dictfile, dict); dictfile.close(); cout << "Please enter a string for an anagram: "; cin >> word; int numMatches = permute(word, dict, results); if (!numMatches) cout << "No matches found" << endl; else display(results); return 0; }|

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Please complete the following functions: 

PLEASE USE VECTORS TO SOLVE. 

I will upvote if correct. 

#include <iostream> #include <fstream> #include <istream> #include <string> #include <vector> using namespace std; // Max matches that can be found const int MAXDICTWORDS = 30000; // Max words that can be read in const int MAXRESULTS = 20; int loadDictionary(istream& dictfile, vector<string>& dict) /*Places each string in dictfile into the vector dict. Returns the number of words loaded into dict.*/ { return -1; // This compiles, but this is incorrect } int permute(string word, vector<string>& dict, vector<string>& results) /* Places all the permutations of word, which are found in dict into results. Returns thenumber of matched words found.*/ { return -1; // This compiles, but this is incorrect } void display(vector<string>& results) /* Displays size number of strings from results. The results can be printed in any order.*/ { return; // This compiles, but this is incorrect } int main() { vector<string> results(MAXRESULTS); vector<string> dict(MAXDICTWORDS); ifstream dictfile; int nwords; // file containing the list of words // number of words read from dictionary string word; dictfile.open ("words.txt"); if (!dictfile) { cout << "File not found!" << endl; return (1); } nwords = loadDictionary(dictfile, dict); dictfile.close(); cout << "Please enter a string for an anagram: "; cin >> word; int numMatches = permute (word, dict, results); if (!numMatches) cout << "No matches found" << endl; else display(results); return 0; }|
Transcribed Image Text:#include <iostream> #include <fstream> #include <istream> #include <string> #include <vector> using namespace std; // Max matches that can be found const int MAXDICTWORDS = 30000; // Max words that can be read in const int MAXRESULTS = 20; int loadDictionary(istream& dictfile, vector<string>& dict) /*Places each string in dictfile into the vector dict. Returns the number of words loaded into dict.*/ { return -1; // This compiles, but this is incorrect } int permute(string word, vector<string>& dict, vector<string>& results) /* Places all the permutations of word, which are found in dict into results. Returns thenumber of matched words found.*/ { return -1; // This compiles, but this is incorrect } void display(vector<string>& results) /* Displays size number of strings from results. The results can be printed in any order.*/ { return; // This compiles, but this is incorrect } int main() { vector<string> results(MAXRESULTS); vector<string> dict(MAXDICTWORDS); ifstream dictfile; int nwords; // file containing the list of words // number of words read from dictionary string word; dictfile.open ("words.txt"); if (!dictfile) { cout << "File not found!" << endl; return (1); } nwords = loadDictionary(dictfile, dict); dictfile.close(); cout << "Please enter a string for an anagram: "; cin >> word; int numMatches = permute (word, dict, results); if (!numMatches) cout << "No matches found" << endl; else display(results); return 0; }|
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS