Write a templated function in C++, named "safe_add" which adds two numbers (ints, floats, doubles, etc) and returns their sum. But, if either number (or their sum) contains the number 7, raise a runtime_error stating "can't add because 6+1 appears in it". Example: const int x = 170, y = 10; ASSERT_THROW(safe_add(x, y), std::runtime_error); ASSERT_EQ(std::string(e.what()), "can't add because 6+1 appears in it"); Example 2: int result = safe_add(66, 30); int expected = 96;

Write a templated function in C++, named "safe_add" which adds two numbers (ints, floats, doubles, etc) and returns their sum. But, if either number (or their sum) contains the number 7, raise a runtime_error stating "can't add because 6+1 appears in it". Example: const int x = 170, y = 10; ASSERT_THROW(safe_add(x, y), std::runtime_error); ASSERT_EQ(std::string(e.what()), "can't add because 6+1 appears in it"); Example 2: int result = safe_add(66, 30); int expected = 96;

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
Write the C equivalent “train” function #void train(int*A, int*B, int*C, int k) train: add $t4, $0, $0bus: add $t5, $t4, $a1 lw $t6, 0($t5) add $t5, $t4, $a2 lw $t7, 0($t5) add $t6, $t6, $t7 add $t5, $t4, $a0 sw $t6, 0($t5) addi $t4, $t4, 4 slt $t5, $t4, a3 bne $t5, $0, bus jr ra
Write a program in C++ using libraries. Write a function that allows case-insensitive comparison of two strings. The return value should be analogous to that from strcmp: s1 < s2 return something < 0 s1 == s2 return something == 0 s1 > s2 return something > 0 (These return values can be short integers.) Just remember that the comparisons are to be done in a manner that ignores the caseof the letters in the strings! But also note that the strings should not be altered at all. Don't change the two string arguments before or during the call. Don't make copies and change the copies. All of this is terribly wasteful and/or destructive of data. Place your new function in a library (strextra?) and call it something useful (strcmp_ncase?). Write a driver program to test your function.
Implement function rotate that takes a string argument s and an integer argument n, and rotates the string s to the left by n times. For example, the code char s[] = "systems"; rotate(s, 3); will change s into "temssys", while the code char t[] = "abcd"; rotate(t, 1); will change t into "bcda". Restrictions: printf and strlen are the ONLY C library functions that you can use in the implementation. void rotate(char *w, int j)
Write a program called p3.py that contains a function called reveal_recursive() that takes a word (string) and the length of the word (int) as input and has the following functionality: 1. prints the word where all characters are replaced by underscores 2. continue to print the word revealing one character at a time. i.e., the second line printed should print the first character followed by “_”’s representing the rest of the word. (see example below) 3. the function should end after printing the entire word once. 4. This function should be recursive Example: #the word is kangaroo ________ k_______ ka______ kan_____ kang____ kanga___ kangar__ kangaro_ kangaroo
Write a function in c++ is ordered that takes an integer array and its size as parameters and returns true if the array elements are ordered in nondecreasing order and returns false if not. For example, integers in {10,0,1,1,5,1009} are ordered in nondecreasing order. On the other hand, integers in {1, 2, 3, 8, 4, 19} are not since 8 > 4
Write an Simple Oop c++ program on template class,use addition of two or three veriable in it
Write a C++ Program using classes, functions (recursive and otherwise), arrays and other C++ commands where a user enters the name of a file and the program calculates the amount of vowels (a,e,i,o,u -lower case and A,E,I,O,U - UPPER CASE, separately!), the letters y, Y, ñ, Ñ, and punctuation marks in the file. You can use the Loren Ipsum generator online for a test file: https://es.lipsum.com/
Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function (defun gcd (n m)"Returns the gcd of two numbers" (let ((dividend n) (divisor m) (remainder 1)) (while (/= remainder 0) (setq remainder (mod dividend divisor)) (setq dividend divisor) (setq divisor remainder)) dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.
Write a Java function called SpOdd, so that this function would take an array of integers as input and return an array of integers with all the odd numbers in the original array. Make sure to keep the same order as the original array and also test your function in the main function. Sample output of the main function: The original Array: [3, 8, 5, 7, 1, 9, 2] The odd elements in the array: [3, 5, 7, 1, 9]
Write a function in c that reads real (fractional) numbers, ?1, ?2, … , ?? from the keyboard into an array of N, starting from index 0. The numbers are read after a prompt.
Implement a C function, named median, that receives two arrays as parameters passed and returns the median of the values stored in these two arrays. The two arrays are sorted. The prototype of the function MUST be: double median(int a[], int b[], int sizeA, int sizeB);For example, if I have int a[] = {1, 2, 10, 12, 100}; and int b[] = {3, 11, 20, 500, 600}; then the median is (11+12)/2 = 11.5.