Home / Expert Answers / Computer Science / have-to-read-in-files-for-each-part-1-the-code-exhibits-the-3e-rules-elegant-efficient-exact-pa149

(Solved): Have to read in files for each part 1) The Code exhibits the 3E rules: (Elegant, Efficient, Exact) ...



1) The Code exhibits the 3E rules: (Elegant, Efficient, Exact).
2) The program will be well documented, (Why, not WHAT the co

Have to read in files for each part

1) The Code exhibits the 3E rules: (Elegant, Efficient, Exact). 2) The program will be well documented, (Why, not WHAT the code was written). 3) The program will be readable: 4) The main comment block will contain the name of the programmer. A) All comments are set apart from the code when possible, B) White space is used to break up the code, C) Variable names are meaningful. D) Each variable is described in a comment explaining what it is for. E) All code is structured into code blocks contained in French braces \{\} . Note: points will be given for unique and efficient code. F) Code will be indented to show subordination. 1. For example a nested if will be inset to show it is within another if block, 5) The program will: A) Read in a block of text (provided). B) Parse the text into words. C) Check to see if each word is on the "ReservedWordList" 1. If the word is on the list it will be skipped. 2. If the word is not on the list the code will output that word on a new line, 3. Note: Point 2 is different than we discussed in class. D) Compile with no errors or warnings. E) Execute with no errors or warnings. (Hint: no gets() ) F) Produce a well structured output. 6) The text file to process will be in "Weekly Assignments". Please review these instructions and if our have any questions, either email me or ask me in lecture or office hours. Enjoy, this will be fun! Here is an overview of most of the logic: I. Read the list of reserved words and put them into an array, II. Sort the list into alpha order (smallest to largest) III. Read the file to parse, one word at a time, IV. Convert the word to lower case, v. Compare the word with the list of reserved words. (Binary Search) VI. If the word is on the list, get the next word, VII. If the word is not on the list, print it out, VIII. Move to the next word. IX. You may have more than one instance of some words. That's fine. Jse only C will report to chegg themselves if yall use any codes yall copied from others.


We have an Answer from Expert

View Expert Answer

Expert Answer


Solution : - Program #include #include #include #include #include #include #include //define namespace using namespace std; int main() { //create a map map frequency; //create
We have an Answer from Expert

Buy This Answer $5

Place Order

We Provide Services Across The Globe