Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Please complete the following functions:  1. int loadDictionary(istream& dictfile, vector& dict)  2. int permute(string word, vector& dict, vector& results) 3. void display(vector& results)  PLEASE USE VECTORS TO SOLVE.  I will upvote if correct.

Please complete the following functions:  1. int loadDictionary(istream& dictfile, vector& dict)  2. int permute(string word, vector& dict, vector& results) 3. void display(vector& results)  PLEASE USE VECTORS TO SOLVE.  I will upvote if correct.

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

Please complete the following functions: 

1. int loadDictionary(istream& dictfile, vector<string>& dict) 

2. int permute(string word, vector<string>& dict, vector<string>& results)

3. void display(vector<string>& results) 

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 4 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
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
SEE MORE TEXTBOOKS