Define a tuple that holds three int values and initialize the members to 10, 20, and 30.
Define a tuple that holds a string, a vector, and a pair<string, int>.
Rewrite the TextQuery programs from § 12.3 (p. 484) to use a tuple instead of the QueryResult class. Explain which design you think is better and why.
Write and test your own version of the findBook function.
Rewrite findBook to return a pair that holds an index and a pair of iterators.
Rewrite findBook so that it does not use tuple or pair.
Explain which version of findBook you prefer and why.
What would happen if we passed Sales_data() as the third parameter to accumulate in the last code example in this section?
Explain the bit pattern each of the following bitset objects contains:
(a) bitset<64> bitvec(32);
(b) bitset<32> bv(1010101);
(c) string bstr; cin >> bstr; bitset<8>bv(bstr);
Using the sequence 1, 2, 3, 5, 8, 13, 21, initialize a bitset that has a 1 bit in each position corresponding to a number in this sequence. Default initialize another bitset and write a small program to turn on each of the appropriate bits.
Define a data structure that contains an integral object to track responses to a true/false quiz containing 10 questions. What changes, if any, would you need to make in your data structure if the quiz had 100 questions?
Using the data structure from the previous question, write a function that takes a question number and a value to indicate a true/false answer and updates the quiz results accordingly.
Write an integral object that contains the correct answers for the true/false quiz. Use it to generate grades on the quiz for the data structure from the previous two exercises.
Write several regular expressions designed to trigger various errors. Run your program to see what output your compiler generates for each error.
Write a program using the pattern that finds words that violate the “i before e except after c” rule. Have your program prompt the user to supply a word and indicate whether the word is okay or not. Test your program with words that do and do not violate the rule.
What would happen if your regex object in the previous program were initialized with "[^c]ei"? Test your program using that pattern to see whether your expectations were correct.
Update your program so that it finds all the words in an input sequence that violiate the “ei” grammar rule.
Revise your program to ignore words that contain “ei” but are not misspellings, such as “albeit” and “neighbor.”
Why is it okay to call m[4].str() without first checking whether m[4] was matched?
Write your own version of the program to validate phone numbers.
Rewrite your phone number program from § 8.3.2 (p. 323) to use the valid function defined in this section.
Rewrite your phone program so that it allows any number of whitespace characters to separate the three parts of a phone number.
Write a regular expression to find zip codes. A zip code can have five or nine digits. The first five digits can be separated from the remaining four by a dash.
Write your own version of the program to reformat phone numbers.
Rewrite your phone program so that it writes only the first phone number for each person.
Rewrite your phone program so that it writes only the second and subsequent phone numbers for people with more than one phone number.
Write a program that reformats a nine-digit zip code as ddddd-dddd.
Write a function that generates and returns a uniformly distributed random unsigned int each time it is called.
Allow the user to supply a seed as an optional argument to the function you wrote in the previous exercise.
Revise your function again this time to take a minimum and maximum value for the numbers that the function should return.
What would happen if we defined b and e inside the do loop of the game-playing program from this section?
What would happen if we defined resp inside the loop?
Write a version of the word transformation program from § 11.3.6 (p. 440) that allows multiple transformations for a given word and randomly selects which transformation to apply.
Write a program that illustrates the use of each manipulator in Tables 17.17 (p. 757) and 17.18.
Write a version of the program from page 758, that printed the square root of 2 but this time print hexadecimal digits in uppercase.
Modify the program from the previous exercise to print the various floating-point values so that they line up in a column.
Use the unformatted version of getline to read a file a line at a time. Test your program by giving it a file that contains empty lines as well as lines that are longer than the character array that you pass to getline.
Extend your program from the previous exercise to print each word you read onto its own line.
Write your own version of the seek program presented in this section.