int hidden(int num1, int num2) { if (num2 > 20) num1 = num2 / 10; else if (num2 > 20) num2 = num1 / 20; else return num1 - num2; return num1 * num2; } int compute(int one, int two) { int secret = one; for (int i = one + 1; i <= twp % 2; i++) secret = secret + i * i; return secret; } What is the output of each othe follorinw program segments? a. cout << hidden(15, 10) << endl; b. cout << compute (3, 9) << endl; c. cout << hidden(30, 20) << " " << compute(10, hidden (30, 20)) << endl; d. x = 2; y = 8; cout << compute (y, x) << endl;

int hidden(int num1, int num2) { if (num2 > 20) num1 = num2 / 10; else if (num2 > 20) num2 = num1 / 20; else return num1 - num2; return num1 * num2; } int compute(int one, int two) { int secret = one; for (int i = one + 1; i <= twp % 2; i++) secret = secret + i * i; return secret; } What is the output of each othe follorinw program segments? a. cout << hidden(15, 10) << endl; b. cout << compute (3, 9) << endl; c. cout << hidden(30, 20) << " " << compute(10, hidden (30, 20)) << endl; d. x = 2; y = 8; cout << compute (y, x) << endl;

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

The greatest integer function is defined by int(x) = the greatest integer that is ....................For example, int(2.5) = ................ int(-2.5) = ............... and int(0.5) = ...................
You are tasked with writing a small part of a museum's ticketing system. The museum calculates ticket prices using the following rules: $20.00 per admission. Children under 15 get a 50% discount. Seniors (60 years and older) get a 25% discount. Write a Python function that takes a list of customers' ages and returns the total cost for the group. Your function must match the docstring below. You do not need to include the docstring in your solution. '''Function -- get_ticket_costCalculates the cost of museum admission for a group.Parameter:group_ages -- A list of integers representing customer ages.Returns:The total cost for the group, a float. The return value is not rounded.''' Example get_ticket_cost([10, 39, 40]) returns 50.0
Please answer it in Python 1) Write a function last_consonant that takes as an argument a word and returns two return values: the index of its last consonant and the last consonant (as for lists, we will consider that the index of the first letter is zero). We will not deal with the problematic case where the word does not contain a consonant. Example: last_consonant('arrivee') returns 4, 'v' 2) Write a function double_consonant that takes as an argument a word and has two return values: a Boolean worth True if the word contains a double consonant (twice the same consonant in a row), and in this case the second return value is the consonant that is doubled; if there is no doubled consonant, the function must return False and None. If the word contains several double consonants (for example, 'successor'), true will be returned and the first double consonant appearing in the word. Examples: double_consonant('arrive') is True, 'r'. double_consonant ('candy') is false, none…
In java: Develop a function that accepts an array of integers and returns their average. Develop a function that accepts an array of integers and a threshold value from the user. The function returns how many values in the array are strictly greater than the cutoff. Using the functions written for #1, #3, and #4, find the number of values above average in two randomly generated arrays. Develop two functions:a. a function that returns the index of the maximum value in an array of integers passed by a caller, the caller prints the returned index and the value at that indexb. a function that returns the index of the alphabetically first value in an array of strings, the caller prints the returned index and the value at that inde Develop two functions:a. a function that swaps the alphabetically first value in an array of Strings with the first value in the array. Call this function twice on two different arrays of Strings; in the caller, use the function written for #2b to display…
Design a class ProblemSolution to overload a function solution. Write a function int solution(int N, char CH) that accepts integer N and character CH. The function should return square of a number (N) if a character (CH) is "s" otherwise return cube of a number. int solution(int N, int M, char CH) that accepts two integers (N and M) and one character CH. The function should return the product of two integers if a character (CH) is ‘p’ otherwise return their sum. boolean solution(String S1, String S2) that accepts two strings S1 and S2. The function should return true if S1 and S2 are equal otherwise false. Input 1 4 s where, First line represents a choice for calling one of the defined methods. (1 for solution(int N, char CH), 2 for solution(int N, int M, char CH) and 3 for solution(String S1, String S2)). Second line represents number input. Third line represents choice CH. Output 16 Here, the first line contains 1 and hence solution(int N, char…
Python Functions for Statistical Applications 1A. Implementation with the standard def keyword Suppose you have done a statistical comparison using the Z-scores approach. Write a function for calculating the lower bound of the 95% CI. A starter code for this function is already provided to you below. def compute_lower_bound(n, mu, stdev, z=1.96):"""Computes lower bound of a confidence intervalParameters:n: Type int. number of data pointsmu: Type float. sample meanstdev: Type float. sample standard deviationz: Type float. critical value. Default to 95%CI that corresponds to value of 1.96"""# YOUR CODE HERE# Hint: A correct implementation can be as short as just 1 line long! 1B. Using the function of Part 1A Run your function on the following scenario: There are 500 data points. The sample mean is 2525 The sample standard deviation is 7.57.5 The critical value at 95% confidence, ?0.95�0.95, is a constant: 1.96 # YOUR CODE HERE 1C. Application of Part 1A Now, you are asked to do the…
Consider the following recursive function. What does it calculate in terms of x, y, and z? 01: Private Function CalcRecurse(ByVal x As Integer, ByVal y As Integer, ByVal z As Integer) As Integer 02: If x <= 1 Then 'Assume that CalcRecurse always starts with x > 1 03: Return y 04: Else 05: Return z + CalcRecurse(x - 1, y, z) 06: End If 07: End Function
The following recursive function takes three positive integer arguments: def compute(n,x,y) : if n==0 : return x return compute(n-1,x+y,y) What is the value returned by the compute function? n*x+y x+y x+n*y x What if: will the returned value be for the compute function defined in the question above if the argument n is negative? x x-n*y x+n*y The function will never return a value.
Implement a program that contains the following two functions: 1. A function that accepts a list of numbers as an argument, the function should recursively calculate the sum of all the numbers in the list and returns that value2. A function that uses recursion to raise a number to a power. The function should accept two arguments: the number to be raised, and the exponent. Assume the exponent is a positive integer
Implement in C Programming 6.10.2: Pass by pointer. Write a function call to ConvertMoney() to store the number of quarters, nickels, and pennies within the integer variables numQuarters, numNickels, and numPennies, respectively. Ex: If the input is 133, then the output is: Quarters: 5 Nickels: 1 Pennies: 3 #include <stdio.h> void ConvertMoney(int totalPennies, int* numQuarters, int* numNickels, int* numPennies) { *numQuarters = totalPennies / 25; totalPennies = totalPennies % 25; *numNickels = totalPennies / 5; totalPennies = totalPennies % 5; *numPennies = totalPennies;} int main(void) { int totalPennies; int numQuarters; int numNickels; int numPennies; scanf("%d", &totalPennies); /* Your code goes here */ printf("Quarters: %d\n", numQuarters); printf("Nickels: %d\n", numNickels); printf("Pennies: %d\n", numPennies); return 0;}
1.The following is the C code that you need to implement for this lab: uint8_ t f(uint8_tn) return(n<2)?(n):(f(n-1)+f(n-2)); The main function can be assumed as follows: int main() uint8_ t x; x=f(???); return 0; Obviously, " ? ? ? " is representing a value used to test the algorithm! Is "f"recursive? a.No answer text provided. b.Yes c.no d.depends on whether it is in for main 2.First, make the code in the previous question an actual C program so that it can be compiled and it runs. Play with it so that you feel comfortable with the logic of the code. Then implement the code in TTPASM. Note that you need to preserve the actual C code structure, this means you cannot it into a non-recursive subroutine. Furthermoreall conventions discussed in class regarding subroutines must be followed. The idea is that I should be able to substitute f with my own code, and main should work. Or, I can substitute main with my own, and f should work. Attach the source code of your assembly…
Programming Language: C Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true. If no such element is not found, the function returns -1. int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A. void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: 1. Start with accumulator = A[0] 2. For i=1...length-1 compute accumulator=f(accumulator, A[i]) 3. Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array. int reduce(int* A, int n, int (*f)(int,int)); Test for the functions: // used for test Q3-find bool is_even(int x) { return x%2 == 0; } bool is_positive(int x) { return x>0; } void…