Program Plan: Include header files. Start "main()" function. Make a string array "spam" containing 30 spam sample keywords. Declare "spamscore" and "countword" variables to store count of spam words and total words respectively. Accept "emailmsg". Use stringstream "s" for breaking words of emailmsg. Start while loop where words from stringstream "s" goes into string "word". Condition of executing loop is till we have words in stream "s". Increment countword. Use for loop for value i=1 to 30 for each word in array "spam". If word is same as one of spam keywords increase spamscore. end for loop end while loop Display Total Number of words in a message. Display Total Number of spam words in a message. Using type casting calculate "spampercent" as "((float)spamscore/(float)countword)*100;". If "spampercent> 30" then display "It's a spam message". else display "It's not a spam". Return and exit "main()" function.

Question

Want to see the full answer?

Answer 1

Question

Chapter 21, Problem 21.27MAD

Program Plan Intro

Program Plan:

Include header files.

Start "main()" function.

Make a string array "spam" containing 30 spam sample keywords.

Declare "spamscore" and "countword" variables to store count of spam words and total words respectively.

Accept "emailmsg".

Use stringstream "s" for breaking words of emailmsg.

Start while loop where words from stringstream "s" goes into string "word". Condition of executing loop is till we have words in stream "s".

Increment countword.

Use for loop for value i=1 to 30 for each word in array "spam".

If word is same as one of spam keywords increase spamscore.

end for loop

end while loop

Display Total Number of words in a message.

Display Total Number of spam words in a message.

Using type casting calculate "spampercent" as "((float)spamscore/(float)countword)*100;".

If "spampercent> 30" then display "It's a spam message".
else display "It's not a spam".

Return and exit "main()" function.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the