Question: Question 1: Question 2: The conversion macro toupper() returns an uppercase version of a lowercase character. If the argument is not a lowercase character, the

Question 1:

Question 1: Question 2: The conversion macro toupper() returns an uppercase versionQuestion 2:

The conversion macro toupper() returns an uppercase version of a lowercase character. If the argument is not a lowercase character, the original character is returned unchanged. Write your own version of toupper() without using the header file.

Hint: The lowercase characters are all contiguous. Similarly, the uppercase characters are contiguous. The two ranges, however, are not contiguous.

. . . .| uppercase |. . .| lowercase | . . .

If you can figure out the distance between a lowercase 'a' and an uppercase 'A', then you can create the converted result.

/** Returns the uppercase version of any lowercase character. @param c the character to modify @return the uppercase version of c if c is lowercase. If not, then c. */

of a lowercase character. If the argument is not a lowercase character,

The header file contains several classification functions. Assume that you don't have access to this header file. Write your own version of isdigit which returns true if a character is one of the digit characters in the range 0..9. Complete the following file: main.cpp 1 2 3 4 5 6 7 8 /** Returns true if the character is in the range 0..9. @param c the character to examine. @return true if c is a digit. */ // Write your function here Complete the following file: main.cpp Returns the uppercase version of any lowercase charact @param c the character to modify @return the uppercase version of c if c is lowercase. 1 2 3 4 5 6 7 */ // Write your function here Submit

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To solve these tasks we need to create two functions one to co... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!