Hello. Can Anyone Please Help This Struggling College Kid?! I’m In A Hurry. The Attached Code…

Hello. Can Anyone Please Help This Struggling College Kid?! I’m In A Hurry. The Attached Code…
Hello. Can Anyone Please Help This Struggling College Kid?! I'm In A Hurry. The Attached Code FixDebug.C Maintains A Thesaurus Where Each Word Is Stored With Words That Have The Same Meaning. When You Run The Program, It Asks For The Word, A Synonym And A Number Indicating How Strong The Relationship Between The Words In With 1 Being The Strongest   hello. can anyone please help this struggling college kid?! i'm in a hurry. The attached code fixDebug.c maintains a thesaurus where each word is stored with words that have the same meaning. When you run the program, it asks for the word, a synonym and a number indicating how strong the relationship between the words in with 1 being the strongest relationship and 2 being a weaker relationship. The following shows a typical usage of the program —————————————- SAMPLE PROGRAM EXECUTION ————————————- Enter a word, synonym, and related factor (example: Structure|House|1) Enter 'Q' by itself to exit (example: Q) Add to thesaurus [word|synonym|factor]: Structure|House|1 Add to thesaurus [word|synonym|factor]: Vehicle|Car|1 Add to thesaurus [word|synonym|factor]: Structure|Building|1 Add to thesaurus [word|synonym|factor]: Vehicle|Truck|1 Add to thesaurus [word|synonym|factor]: Feline|Tiger|2 Add to thesaurus [word|synonym|factor]: error !!! Invalid input !!! Enter a word, synonym, and related factor (example: Structure|House|1) Enter 'Q' by itself to exit (example: |) Add to thesaurus [word|synonym|factor]: Structure|Shed|3 Add to thesaurus [word|synonym|factor]: Q Thesaurus Data: 1) Structure 1. House (Factor:1) 2. Building (Factor:1) 3. Shed (Factor:3) 2) Vehicle 1. Car (Factor:1) 2. Truck (Factor:1) 3) Feline 1. Tiger (Factor:2) Application exiting… Goodbye! ————————- END OF SAMPLE —————————- Unfortunately, some bugs have crept into the program and need to be fixed. Your job is to: Find and fix the bugs in the program so it works as intended, For each bug you fixed, show The original line number, original text and your new text for the line An explanation of what was wrong on that line and what you did to fix it /* Example Execution(B): Enter a word, synonym, and related factor (example: Structure|House|1) Enter 'Q' by itself to exit (example: Q) Add to thesaurus [word|synonym|factor]: Structure|House|1 Add to thesaurus [word|synonym|factor]: Vehicle|Car|1 Add to thesaurus [word|synonym|factor]: Structure|Building|1 Add to thesaurus [word|synonym|factor]: Vehicle|Truck|1 Add to thesaurus [word|synonym|factor]: Feline|Tiger|2 Add to thesaurus [word|synonym|factor]: error !!! Invalid input !!! Enter a word, synonym, and related factor (example: Structure|House|1) Enter 'Q' by itself to exit (example: |) Add to thesaurus [word|synonym|factor]: Structure|Shed|3 Add to thesaurus [word|synonym|factor]: Q Thesaurus Data: 1) Structure 1. House (Factor:1) 2. Building (Factor:1) 3. Shed (Factor:3) 2) Vehicle 1. Car (Factor:1) 2. Truck (Factor:1) 3) Feline 1. Tiger (Factor:2) Application exiting… Goodbye! */ #define _CRT_SECURE_NO_WARNINGS #include #include #include #define MAX_SZ 20 #define MAX_LINE 50 #define MAX_ENTRIES 100 struct Synonym { char name[MAX_SZ + 1]; int relatedFactor; // 1=highly | 2=moderately | 3=loosely }; struct WordInfo { char word[MAX_SZ + 1]; struct Synonym synonyms[MAX_ENTRIES]; int synonymCount; }; void clearInputBuffer(void) { while (getchar() != 'n') ; // empty on purpose } int add(const char word[], const char synonym[], const int relatedFactor, struct WordInfo thesaurus[], int arrSize) { int addedWord = 0, found = 0, i; // lookup for existing word for (i = 0; i < arrsize="" &&="" !found;="" i++)="" {="" found="" match="" if="" (!strcmp(word,="" thesaurus[i].word))="" {="" strcpy(thesaurus[i].word,="" synonym);="" thesaurus[i].synonyms[thesaurus[i].synonymcount].relatedfactor="relatedFactor;" thesaurus[i].synonymcount++;="" found="1;" toggle="" exit="" from="" loop="" }="" not="" found="" and="" empty="" slot:="" add="" to="" thesaurus.word="" array="" |="" set="" thesaurus.synonymcount="" to="" 1="" |="" set="" result="" to="" 1="" else="" if="" (thesaurus[i].word[0]="=" '')="" {="" addedword="1;" toggle="" return="" value="" to="" 1="" (added)="" found="1;" toggle="" exit="" from="" loop="" strcpy(thesaurus[i].word,="" word);="" strcpy(thesaurus[i].synonyms[0].name,="" word);="" thesaurus[i].synonyms[0].relatedfactor="relatedFactor;" thesaurus[i].synonymcount++;="" }="" }="" return="" addedword;="" }="" int="" main(void)="" {="" struct="" wordinfo="" thesaurus[max_entries]="{" {="" {0}="" }="" };="" int="" i,="" j,="" quitting,="" numentries="0," valid;="" char="" word[max_sz="" +="" 1],="" synonym[max_sz="" +="" 1];="" int="" relatedfactor;="" -----------------------------="" instructions="" printf("enter="" a="" word,="" synonym,="" and="" related="" factor="" (example:="" structure|house|1)n");="" printf("enter="" 'q'="" by="" itself="" to="" exit="" (example:="" q)nn");="" do="" {="" -----------------------------="" prompt:="" printf("add="" to="" thesaurus="" [word|synonym|factor]:="" ");="" valid="scanf("%20[^|n]|%20[^|]|%d"," word,="" synonym,="" &relatedfactor);="" clearinputbuffer();="" quitting="(valid" =="1" &&="" strcmp("q",="" word)="=" 0);="" if="" (quitting)="" {="" -----------------------------="" display="" the="" thesaurus="" printf("n");="" printf("thesaurus="" data:n");="" for="" (i="0;" i="">< numentries;="" i++);="" {="" printf("%2d)="" %sn",="" i="" +="" 1,="" thesaurus[i].word);="" for="" (j="0;" j="">< thesaurus[i].synonymcount;="" j++)="" {="" printf("t%2d.="" %s="" (factor:%d)n",="" j="" +="" 1,="" thesaurus[i].synonyms[j].name,="" thesaurus[i].synonyms[j].relatedfactor);="" }="" }="" printf("n");="" }="" else="" if="" (valid="=" 3)="" {="" -----------------------------="" if="" new="" word="" was="" added,="" returns="" 1,="" otherwise="" 0="" numentries="" +="add(word," synonym,="" relatedfactor,="" thesaurus,="" max_entries);="" }="" else="" {="" -----------------------------="" show="" error="" message="" printf("n");="" printf("!!!="" invalid="" input="" !!!n");="" printf("enter="" a="" word,="" synonym,="" and="" related="" factor="" (example:="" structure|house|1)n");="" printf("enter="" 'q'="" by="" itself="" to="" exit="" (example:="" |)nn");="" }="" }="" while="" (quitting);="" -----------------------------="" show="" goodbye="" printf("application="" exiting...="" goodbye!n");="" return="" 0;="" }="" quick="" test="" (copy/paste="" into="" command="" window):="" structure|house|1="" vehicle|car|1="" structure|building|1="" vehicle|truck|1="" feline|tiger|2="" error="" structure|shed|3="" q="">   May 13 2022 07:27 PM

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more
Open chat
1
You can contact our live agent via WhatsApp! Via + 1 (409) 205-8984

Feel free to ask questions, clarifications, or discounts available when placing an order.

Order your essay today and save 30% with the discount code DISCOUNT