Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

C++ Task 1: Create a C-style string for sentence/paragraph and read a sentence/paragraph from the user. You can make a static array for this, but

C++

Task 1: Create a C-style string for sentence/paragraph and read a sentence/paragraph from the user. You can make a static array for this, but make sure your getline has the appropriate length. Use cin.getline(array_name, num_chars_to_read)for C-style strings. What do you think may happen if you enter more characters than specified by num_chars_to_read in cin.getline()? The code below may help this problem. if (cin.fail()) { cin.ignore(256, ); //get rid of everything leftover cin.clear(); //reset the failbit for the next cin } Task 2: Create an array of C++ strings for the N words that user wants to search for and read those words from the user. Ask the user how many words they want to search for. Create an array of that many words Read each word from the user. Remember, you would use getline for C++ strings. getline(cin, word_array_name[i]); You need to have a main function that asks for a sentence/paragraph and for the N words. After getting inputs from user, print out both arrays to check if they are working properly. Remember to check memory leaks as well.

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Microsoft SQL Server 2012 Unleashed

Authors: Ray Rankins, Paul Bertucci

1st Edition

0133408507, 9780133408508

More Books

Students also viewed these Databases questions

Question

2. How will the team select a leader?

Answered: 1 week ago

Question

3. What may be the goal of the team?

Answered: 1 week ago