Assume a 2²² byte memory:

a. What are the lowest and highest addresses if memory is byte-addressable?

b. What are the lowest and highest addresses if memory is word-addressable, assuming a 16-bit word?

c. What are the lowest and highest addresses if memory is word-addressable, assuming a 32-bit word?

Explain with Steps please

Pick at least one of the buttons or menu items in MS Word not covered in this class' Word Modules. What is its name, and where is it located in the MS Word interface? What does it do? How have you or might you use it in an MS Word document to make your work products better? Explain how to transform, or export, do a layout, design, or it can make a flyer or,insert, a document must be 230- 250-word discussion any one of these.

Write the following Python script:

Pikachu is a well-known character in the Pokemon anime series. Pikachu can speak, but only 3 syllables: "pi", "ka", and "chu". Therefore Pikachu can only pronounce strings that can be created as a concatenation of one or more syllables he can pronounce. For example, he can pronounce the words "pikapi" and "pikachu".

You are given a String word. Your task is to check whether Pikachu can pronounce the string. If the string can be produced by concatenating copies of the strings "pi", "ka", and "chu", return "YES" (quotes for clarity). Otherwise, return "NO".

Constraints:

• word contains between 1 and 50 characters, inclusive
• each character of word will be a lower-case letter 'a'-'z'

Check your work with these examples:

-------------------------------------------------------

word = "kpia"

Returns: "NO"

-------------------------------------------------------

word = "chuchucpihu"

Returns: "NO"

-------------------------------------------------------

word = "pikapi"

Returns: "YES"

"pikapi" = "pi" + "ka" + "pi", so Pikachu can say it.

-------------------------------------------------------

word = "pipikachu"

Returns: "YES"

This time we have "pipikachu" = "pi" + "pi" + "ka" + "chu", so Pikachu can say it as well.

-------------------------------------------------------

word = "pikaqiu"

Returns: "NO"

Pikachu can't say "pikaqiu" since 'q' does not appear in "pi", "ka", or "chu".

-------------------------------------------------------

word = "chupikachupipichu"

Returns: "YES"

-------------------------------------------------------

word = "duke"

Returns: "NO"

IN C++

Note: While there are many ways to do conversions to pig latin, I will require that you follow the procedures below, all of which will use the following structure:

struct Word {
 string english;
 string piglatin;
};

Part 1. Write a function that takes in an English sentence as one string. This function should first calculate how many “words” are in the sentence (words being substrings separated by whitespace). It should then allocate a dynamic array of size equal to the number of words. The array contains Word structures (i.e. array of type Word). The function would then store each word of that sentence to the english field of the corresponding structure. The function should then return this array to the calling function using the return statement, along with the array size using a reference parameter.

This function should also remove all capitalization and special characters other than letters. Implement the function with the following prototype

Word * splitSentence(const string words, int &size);

Part 2. Write a function that takes in an array of Word structures and the size of the array and converts each english field to the corresponding piglatin field.

void convertToPigLatin(Word [] wordArr, int size);

To do this conversion, if a word starts with a consonant, the piglatin conversion of the word involves moving the first letter of the word to the end of the string and then adding “ay” to the end.

pig -> igpay

cat -> atcay

dog -> ogday

If the word starts with a vowel, simply add “way” to the end of the word

apple -> appleway

are -> areway

Part 3. Write a function that takes in an array of Word structures and outputs the pig latin part of it to the screen, with each word separated by a space.

void displayPigLatin(const Word [] wordArr, int size);

Example:

Please enter a string to convert to PigLatin:
Casino is nothing but a Goodfellas knockoff
Output:
asinocay isway othingnay utbay away oodfellasgay nockoffkay 

Error conditions: Your program should get rid of all punctuation and special characters other than letters. Your program should be able to deal with there being two or more spaces between words.

Note: Make sure to follow proper programming style, as per the style supplement.

I have the following python code. I get the following message when running it using a test script which I cannot send here:

while textstring[iterator].isspace(): # loop until we get other than space character

IndexError: string index out of range. Please find out why and correct the code.

def createWords(textstrings):
        createdWords = [] # empty list
        for textstring in textstrings: # iterate through each string in trxtstrings
                iterator = 0
                begin = iterator # new begin variable
                while (iterator < len(textstring)): # iterate through each character in the string
                        finished = iterator # new finished character
                        while textstring[iterator].isspace(): # loop until we get other than space character
                                iterator = iterator+1
                                word = textstring[begin:finished+1].strip() #  extract the word from begin position to before the space character,
                                                                                                                        #  textstring[begin,finshed] ; strip() will remove white spaces at ends
                                if (word): # if word is not empty
                                        createdWords.append(word) # append new word to createWords
                                begin = iterator # update begin value with current iterator position
                        if (textstring[iterator]).isalpha():
                                if (textstring[iterator].isupper()): # if letter is in uppercase  change it to lower case by using letter.lower() method.
                                        textstring = textstring[:iterator] + textstring[iterator].lower() + textstring[iterator+1:]
                                print(textstring[iterator],"this a letter")
                        elif (textstring[iterator]).isdigit():
                                print(textstring[iterator],"is a digit")
                        else:
                                print(textstring[iterator],"this a symbol")
                                word = textstring[begin:finished].strip()       #  extract the word from begin position to before the symbol character,
                                                                                                                        #  textstring[begin,finshed] ; strip() will remove white spaces at ends
                                createdWords.append(word) # append new word to createWords
                                begin = iterator  # update begin value with current iterator position
                        iterator= iterator+1 # increment iterator value
                word = textstring[begin:iterator].strip()  #  extract the word from begin position to the end of the string
                createdWords.append(word) # append new word to createWords
        return createdWords # return createWords

A (7, 4) cyclic code is designed with a generator polynomial, g(D) = D3 + D + 1. a) (10 points) Determine the code word for the message, 1010. b) (10 points) Determine the code word for the message, 1100. c) (9+1= 10 points) Determine the error polynomial for the received word, 1110101. Is the received word correct?

A (7, 4) cyclic code is designed with a generator polynomial, g(D) = D3 + D + 1. a) (10 points) Determine the code word for the message, 1010. b) (10 points) Determine the code word for the message, 1100. c) (9+1= 10 points) Determine the error polynomial for the received word, 1110101. Is the received word correct?

pseudo-code, please

If a word has a tag O, it means that the word has nothing to do with the named entity (it is not a part of a named entity such as a location, person name, organization, and etc.)

If a word has a tag starting with B, it means that the word is the beginning of a named entity. For instance, the tag B-per means that the associated word is the beginning of a person's name. On the other hand, if a word has a tag starting with I, it means the word is inside a named entity. Hence, the tag I-per means that the associated word is inside a person's name.

Thousands O

of O

demonstrators O

have O

marched O

through O

London B-geo

Take the following lines in the file for example.

President B-per

Mahmoud I-per

Ahmadinejad I-per

said O

We know the words “President, Mahmoud, and Ahmadinejad” cover a named entity of the type person name.

Could you write pseudo code to pull the names out of a file that are stated in the example

Question 1

1. Pain in a joint Blank 1 (Blank 2 - root word, Blank 3 - suffix)

2.00000 points

Question 2

1. With reference to something within a muscle : Blank 1 Blank 2 – prefix,(Blank 3 - root word, Blank 4 - suffix)

2.00000 points

Question 3

1. Refers to “beneath the skin : Blank 1 Blank 2 – prefix,(Blank 3 - root word, Blank 4 - suffix)

2.00000 points

Question 4

1. The process of viewing the esophagus, stomach and duodenum : Blank 1 (Blank 2 – root word,(Blank 3 - root word, Blank 4 - root word, Blank 5 - process of viewing)

2.00000 points

Question 5

1. Pertaining to (being) against seizures: Blank 1 (Blank 2 – prefix,(Blank 3 - root word, Blank 4 - suffix)

2.00000 points

Question 6

1. Inflammation of meninges : Blank 1 Blank 2 - root word, Blank 3 - suffix)

2.00000 points

Question 7

1. Inflammation of many nerves : Blank 1 ( Blank 2-prefix, Blank 3 - root word, Blank 4 - suffix)

2.00000 points

Question 8

1. Heart specialist : Blank 1 (Blank 2 - root word, Blank 3 - suffix)

2.00000 points

Question 9

1. Taking place within veins : Blank 1 Blank 2 – prefix,(Blank 3 - root word, Blank 4 - suffix)

2.00000 points

Question 10

1. Fat cell : Blank 1 Blank 2 - root word, Blank 3 - suffix)

2.00000 points