Write a program that encodes English language phrases into pig Latin. Pig Latin is a form of coded language often used for amusement. Many variations exist in the methods used to form pig Latin phrases. For simplicity, use the following algorithm: To form a pig-Latin phrase from an English-language phrase, tokenize the phrase into words with function strtok. To translate each English word into a pig-Latin word, place the first letter of the English word at the end of the English word and add the letters “ay.” Thus, the word “jump” becomes “umpjay,” the word “the” becomes “hetay” and the word “computer” becomes “omputercay.” Blanks between words remain as blanks. Assume that the English phrase consists of words separated by blanks, there are no punctuation marks and all words have two or more letters. Function printLatinWord should display each word. [Hint: Each time a token is found in a call to strtok, pass the token pointer to function printLatinWord and print the pig-Latin word.]

Write a program that uses function strncmp to compare two strings input by the user. The program should input the number of characters to compare. The program should state whether the first string is less than, equal to or greater than the second string.

Write a program that uses function strcmp to compare two strings input by the user. The program should state whether the first string is less than, equal to or greater than the second string.

What does this program do?

1 
2   // What does this program do?
3   #include <iostream>
4   using namespace std;
5
6   bool mystery3( const char *, const char * ); // prototype
7
8   int main()
9   {
10      char string1[ 80 ], string2[ 80 ];
11
12      cout << "Enter two strings: ";
13      cin >> string1 >> string2;
14      cout << "The result is " << mystery3( string1, string2 ) << endl;
15  } // end main
16
17  // What does this function do?
18  bool mystery3( const char *s1, const char *s2 )
19  {
20      for ( ; *s1 != '\0' && *s2 != '\0'; ++s1, ++s2 )
21
22          if ( *s1 != *s2 )
23              return false;
24
25      return true;
26  } // end function mystery3

Write your own versions of the functions for manipulating blocks of memory.

Write your own versions of the functions for searching strings.

Write your own versions of the functions for converting strings to numbers.

Using the ASCII character chart, write your own versions of the character-handling functions.

Write a program that inputs an ASCII code and prints the corresponding character. Modify this program so that it generates all possible threedigit codes in the range 000–255 and attempts to print the corresponding characters. What happens when this program is run?

Write a program that reads a series of strings and prints only those strings that end with the letters “ED.”

Write a program that reads a series of strings and prints only those strings beginning with the letter “b.”

The chart in Appendix B shows the numeric code representations for the characters in the ASCII character set. Study this chart, then state whether the following is true or false:

If a sort program sorts strings into ascending sequence, then the program will place the symbol for a right parenthesis before the symbol for a left parenthesis.

The chart in Appendix B shows the numeric code representations for the characters in the ASCII character set. Study this chart, then state whether the following is true or false:

The digits come before the letters.

The chart in Appendix B shows the numeric code representations for the characters in the ASCII character set. Study this chart, then state whether the following is true or false:

The commonly used symbols for addition, subtraction, multiplication and division all come before any of the digits.