Cindy transmitted a four-letter word to Donald.  After her computer took the ASCII representation for the word and applied the Hamming(7,4) code, Bob received this:

   1100011 0011001 1011010 1111111 0010010 0111110 1101010

Unfortunately, there were a number of errors in the transmission. Fortunately, however, there was never more than one bit error in any 7-bit block, and hence the Hamming(7,4) code was able to fix them all. Type in the four-letter word (using letters of the alphabet) that Cindy originally sent, in lower case.  (Note: Assume that the data occurs in the format we described in class whereby the three parity bits follow the four data bits, i.e. d₁ d₂ d₃ d₄ p₁ p₂ p₃ . This may differ from the order found in descriptions of Hamming(7,4) found on the web.)

1. Open Microsoft Word

2. On the first line, type the words Word VBA Test Bed

3. Save the document as WordVBATestBed.docm. (It is vital that this is a macro-enabled document.)

4. Ensure that the Developer Tab is visible.

5. Ensure that the Visual Basic Editor is setup in accordance with pages 87 and 88 in the textbook.

6. Insert a module into this document.

7. Add the Option Base 1 instruction under Option Explicit.

4. Using the Visual Basic Editor, create a VBA procedure named create_object that does the following: a. Creates a variable of the Object type. b. Using the Set command, assign the third word of the first paragraph of the active document to the variable. c. Using appropriate methods, make the object bold. d. When you test the procedure, the third word of your document (test) should be bold.

It just needs to have "Option Explicit" at the beginning.

C++

Develop program in C++ using arrays of characters, subscript operator, the cstring library, and functions with arguments. Create programs with small functions where main goes to a series of functions where the real work takes place. Don’t use global variables and don’t use break within a loop (unless working with a switch statement). Functions can’t have more than 30 statements of code, not including comments, blank lines, or variable definitions. Don’t use a return in the middle of the loop

Most words in the English language are based on words from ancient Greek and Latin. Breaking down a word and understanding its root can really help in understanding the meaning of more complex words. A root can be at the beginning, middle, or end of a word. A root of a word has no prefix or suffix – think of it as the most basic part of a word. Common prefix and suffix added to roots are things like:

• Prefixes: un, anti making words like unclear, antibody
• Suffixes: able, or tion, making words like solvable or solution.
• There are others

Find the root of a word, so there is a better chance of understanding the meaning of the word.

Help the user find the root of a word by removing the affixes (both prefixes and suffixes). Limit the number of prefixes and suffixes to just 3 each that will be removed. Enter those from the user rather than hard-coding them.

Once the six affixes are supplied, the program should let the user enter in a sentence and get rid of all of the prefixes and suffixes to show what the sentence would be like in the most basic form. Words can be no longer than 20 characters and sentences no longer than 200 characters. Work word by word or process the entire sentence all at once.

1. 1. Sentences may have capital letter. A capitalized word or one all in upper case should be handled the same as one with lower case letters. Maybe write a function to turn everything read in into the same case to avoid long conditionals.
2. 2. Realize that sentence may have punctuation. These will not be part of the root of a word and should be removed.

• read into an array of characters.
• prompt the user for any input requested. Make sure it is clear from your prompts what the user is expected to do.
• Use the cstring library with strlen to know when to stop processing the array of characters. strlen should not be in the conditional expression. Consider using it prior to a loop and storing the results of strlen in a variable.
• Don’t use any global variables in this program!
• Don’t use the string class – instead use arrays of characters with cstrings
• Make sure to use C++’s I/O (iostream library) for your input and output.
• functions must be written

Explain how one word might be open to interpretation.

Please make sure the answer is at least 250 words. ******250 words each and include a word count. Each question is worth 12.5 points.******

Create a program that translates English into Pig Latin.

The function will take the first letter of each word in the sentence only if it’s a not a vowel, and place it at the end of the word followed by “ay”.

Your program must be case ​ins​ ensitive. You must write the functiontranslate() ​that takes in a single English word and ​returns​ its Pig Latin translation. Remembertranslatemusttake​onlyonewordasinput.​

#############################################################
# translate() takes a single english word translates it to

#pig latin
# Input:english_word; an English word
# Output:the pig latin translation

Here is some sample output, with the user input in ​blue​.
(Yours does not have to match this word for word, but it should be similar.)

linux[0]$ python hw5_part4.py
Enter an English phrase: ​You look nice today
I think you meant to say: Youay ooklay icenay odaytay

Enter an English phrase: ​Again we don't have to worry about punctuation.
I think you meant to say: Againay eway on'tday avehay otay orryway aboutay unctuation.pay

Enter an English phrase: ​I realized that this problem isn't as easy as I had thought.
I think you meant to say: Iay ealizedray hattay histay roblempay isn'tay asay easyay asay Iay adhay hought.tay

Enter an English phrase: ​Owls have 14 vertebrae in their necks. So fancy!
I think you meant to say: Owlsay avehay 41ay ertebraevay inay heirtay ecks.nay oSay ancy!fay

Who knew there were so many great words that start with the letter D? These are words that will benefit you both in college and after your graduate because they will amplify your written and spoken English. Some may be familiar to you; others may not. In either case, in your Word Journal, you will list the words and their definitions. Even if you think you know the definition of a word, I encourage you to look it up in a dictionary (or on a dictionary website) to be sure.

Some words may have multiple definitions. It is fine for you to include the first two or three definitions listed in the dictionary entry. Those will be the most common definitions for the word.

Here is your list of D words:

decorum

deference

delusion

denigrate

desiccate

despotic

diatribe

dichotomy

diction

didactic

discern

disingenuous

disparate

dissipate

divergent

dubious

This next group of words begin with the letters E and F. These are helpful words to learn because they will benefit you both now and after you graduate. Try to find ways to use these words as you write and speak to others. Even if you think you know what the word means, I encourage you to look it up.  

Your Word Journal should include each word and its definition.

Here are your E and F words (and one isn't a word, it's an abbreviation):

1. e.g.
2. egregious
3. elude
4. emergent
5. empathy
6. emulate
7. enigma
8. ennui
9. epiphany
10. epitaph
11. eradicate
12. erudite
13. eschew
14. ethereal
15. exacerbate
16. existential
17. exponential
18. extrapolate
19. extricate
20. formative
21. formidable
22. fruition

Typing errors in a text are either nonword errors (as when "the" is typed as "teh") or word errors that result in a real but incorrect word. Spell‑checking software will catch nonword errors but not word errors. Human proofreaders catch 70%70% of word errors.

You ask a fellow student to proofread an essay in which you have deliberately made 1010 word errors.

(a) If ?X is the number of word errors missed, what is the distribution of ?X ? Select an answer choice.

?X is approximately Normal with ?=3μ=3 and ?=1.45σ=1.45

?X is binomial with ?=10n=10 and ?=0.3p=0.3

?X is binomial with ?=10n=10 and ?=0.7p=0.7

?X is Normal with ?=7μ=7 and ?=1.45σ=1.45

If ?Y is the number of word errors caught, what is the distribution of ?Y ? Select an answer choice.

?Y is binomial with ?=10n=10 and ?=0.7p=0.7

?Y is binomial with ?=10n=10 and ?=0.3p=0.3

?Y is approximately Normal with ?=3μ=3 and ?=1.45σ=1.45

?Y is Normal with ?=7μ=7 and ?=1.45σ=1.45

(b) What is the mean number of errors caught? (Enter your answer as a whole number.)

mean of errors caught =

What is the mean number of errors missed? (Enter your answer as a whole number.)

mean of errors missed =

(c) What is the standard deviation of the number of errors caught? (Enter your answer rounded to four decimal places.)

standard deviation of the number of errors caught =

What is the standard deviation of the number of errors missed? (Enter your answer rounded to four decimal places.)

standard deviation of the number of errors missed =

In a study conducted by WOMMA (Word of Mouth Marketing Association), 81% of consumers are influenced by a friend's social media posts. Their research also revealed that the average American mentions a brand some sixty times a week in online and offline conversations. How powerful and influential is social media word-of-mouth to a brand or a public figure? Find an example of where social word-of-mouth has made or broken an organization and an example where it has changed government or culture.

An English word is called palindrome if its meaning may be interpreted the same way in either forward or reverse direction. Some examples of common palindromic words: civic, radar, level, rotor, noon, etc.

Design an algorithm that takes a word as input and decides if the input word is palindrome. In your algorithm, a stack should be used. Describe the pseudo-code of your algorithm. What is the time complexity of your algorithm in big-O?

PLEAS USE PSEUDO-CODE.

Using java, create a class called MyString that has one String called word as its attribute and the following methods:
Constructor that accepts a String argument and sets the attribute.

Method permute that returns a permuted version of word. For this method, exchange random pairs of letters in the String. To get a good permutation, if the length of the String is n, then perform 2n swaps.

Use this in an application called Jumble that prompts the user for a word and the required number of jumbled versions and prints the jumbled words. For example,
Enter the word: mixed
Enter the number of jumbled versions required: 10

xdmei
eidmx
miexd
emdxi
idexm
demix
xdemi
ixdme
eximd
xemdi
xdeim

Notes:
1. It is tricky to swap two characters in a String. One way to accomplish this is to convert your String into an array of characters, swapping the characters in the array, converting it back to a String and returning it.
char[] chars = word.toCharArray(); will convert a String word to a char array chars.
String result = new String(chars); converts a char array chars into a String.