Can you do 1 and 2 please? (C++ language) 1- Please implement the Word Counting program that is shown in the pictures attached. 2- Also in the same program count the number of words longer than 3 letters.
Can you do 1 and 2 please? (C++ language) 1- Please implement the Word Counting program that is shown in the pictures attached. 2- Also in the same program count the number of words longer than 3 letters.
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...
Related questions
Question
Can you do 1 and 2 please? (C++ language)
1- Please implement the Word Counting
2- Also in the same program count the number of words longer than 3 letters.
![The code for the Word Counter program (part 3)
while (infile >> word) (
string new word = "";
for (char : word) {
}
}
MURACH BOOKS
}
if (c == '.' || c == ',') {
continue;
} else if (isupper (c)) (
new_word += tolower (c); // convert to lowercase
else {
}
new word += c;
}
infile.close();
words.push_back (new_word);
}
return words;
}
The code for the Word Counter program (part 4)
map<string, int> get_word_count (const vector<string>& words) {
map<string, int> word_count ();
for (string word words) {
auto search = word_count.find(word);
if (search == word_count.end()) {
word_count [word] = 1;
// remove punctuation
Murach's C++ Programming
// add word
}
return word_count;
} else {
word_count [word] += 1; // found increment count
// for word
// not found - add word
// with count of 1
C10, Side 71](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F549651ba-b33d-474d-abf4-48863f7a8bc4%2Fd8b9af18-d4d7-45b4-b03b-0859b5275e6e%2F14w17z2_processed.png&w=3840&q=75)
Transcribed Image Text:The code for the Word Counter program (part 3)
while (infile >> word) (
string new word = "";
for (char : word) {
}
}
MURACH BOOKS
}
if (c == '.' || c == ',') {
continue;
} else if (isupper (c)) (
new_word += tolower (c); // convert to lowercase
else {
}
new word += c;
}
infile.close();
words.push_back (new_word);
}
return words;
}
The code for the Word Counter program (part 4)
map<string, int> get_word_count (const vector<string>& words) {
map<string, int> word_count ();
for (string word words) {
auto search = word_count.find(word);
if (search == word_count.end()) {
word_count [word] = 1;
// remove punctuation
Murach's C++ Programming
// add word
}
return word_count;
} else {
word_count [word] += 1; // found increment count
// for word
// not found - add word
// with count of 1
C10, Side 71
Transcribed Image Text:The code for the Word Counter program (part 1)
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <map>
using namespace std;
vector<string> load_words (string filename);
map<string, int> get_word_count (const vector<string>& words);
int main() {
cout << "The Word Counter program\n\n";
string filename = "dickens.txt";
auto words = load_words (filename);
}
cout << words.size() << WORDS: ";
for (string word words) {
cout << word <<
}
cout << endl << endl;
auto word_count = get_word_count (words);
MURACH BOOKS
The code for the Word Counter program (part 2)
cout << word_count.size() << " UNIQUE WORDS: ";
for (auto pair
word_count) {
cout << pair.first << ' ';
}
cout << endl << endl;
cout << "COUNT PER WORD: ";
for (auto pair
cout << pair.first << ¹=¹ << pair.second << ¹;
Murach's C++ Programming
}
cout << endl << endl;
if (infile) (
word_count) (
vector<string> load_words (string filename) {
vector<string> words;
ifstream infile (filename);
string word;
C10, 560
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 5 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY