You are given a text file (Words.txt) containing 50 words that will be hard to make out because they have been littered with punctuation. Your task is to: • Create a new file called Words2.txt, from Words.txt, which contains all the strings from the previous file, with their position, but with all the punctuation removed. (You must create some sort of method that can loop through the words to do this, you are not allowed to use Regex Patterns) Hint: This might come in handy String punctuation = "!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~"; • You must find the first longest word that appears in the text file with their position retained as well as indicating the number of characters therein, the formatting for this can be seen in Table 1.
You are given a text file (Words.txt) containing 50 words that will be hard to make out because they have been littered with punctuation. Your task is to: • Create a new file called Words2.txt, from Words.txt, which contains all the strings from the previous file, with their position, but with all the punctuation removed. (You must create some sort of method that can loop through the words to do this, you are not allowed to use Regex Patterns) Hint: This might come in handy String punctuation = "!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~"; • You must find the first longest word that appears in the text file with their position retained as well as indicating the number of characters therein, the formatting for this can be seen in Table 1.
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter8: Arrays And Strings
Section: Chapter Questions
Problem 6PE
Related questions
Question
You are given a text file (Words.txt) containing 50 words that will be hard to make
out because they have been littered with punctuation.
Your task is to:
• Create a new file called Words2.txt, from Words.txt, which contains all the
strings from the previous file, with their position, but with all the punctuation
removed. (You must create some sort of method that can loop through the
words to do this, you are not allowed to use Regex Patterns)
Hint: This might come in handy
String punctuation = "!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~";
• You must find the first longest word that appears in the text file with their
position retained as well as indicating the number of characters therein, the
formatting for this can be seen in Table 1.
AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution
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.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT