Computer Science( Only third question )Question 2.a. Let the function fun be defined asint fun(int *k) {*k += 4;return 3 * (*k) - 1;Suppose fun is used in a program as follows:void main(O{int i = 10, j = 10, suml, sum2;suml = (i / 2) + fun (&i);sum2 = fun (&j) + (j / 2);}What are the values of sum1 and sum2 in the following two cases?1) If the operands in the expression are evaluatedleft to right2) If the operands in the expression are evaluatedright to leftsum1 = (inew / 2) + fun(&iold)= 14 / 2 + (3 * (10 + 4) 1)sum1 = (iold / 2) + fun(&iold)= (10 / 2) + (3 * (10 + 4) 1)= 5+ 41= 46sum2 = fun(&jold) + (įnew / 2)= (3 * (10 + 4) – 1) + (14 / 2)= 7+41= 48sum2 = fun(&jold) + (jold / 2)= (3 * (10 + 4) – 1) + (10 / 2)= 41 +7= 41 +5= 48= 46Question 3:Rewrite the program in Question 2 part a in Java and C#, run them, and compare theresults.

The pointer variable is the variable which is to store the address of a variable or reference of a…

Question 2. a. Let the function fun be defined as int fun(int *k) { *k += 4; return 3 * (*k) - 1; Suppose fun is used in a program as follows: void main(){ int i 10, j = 10, suml, sum2; suml = (i / 2) + fun (&i); sum2 = fun (&j) + (j / 2); What are the values of sum1 and sum2 in the following two cases?

Question 2. a. Let the function fun be defined as int fun(int k) { k += 4; return 3 * (*k) - 1; Suppose fun is used in a program as follows: void main(){ int i 10, j = 10, suml, sum2; suml = (i / 2) + fun (&i); sum2 = fun (&j) + (j / 2); What are the values of sum1 and sum2 in the following two cases?

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 1TF

See similar textbooks

Similar questions

Problem 6: Induction and Recursion Consider a postal system for which the minimum postage required for any service (e.g. mailing a postcard) is 18 cents. [a] Prove by strong induction that any postage ≥ 18 can be formed using only 4-cent and 7-cent stamps. (Hint: consider bases cases for 18 thru 21.) [b] Write a Java/Python-like pseudocode for a function that determines the number of each denomination of stamp for a postage amount ≥ 18. (It need not be concerned with lesser cases as they are never used).
Question 2: Implementing a Recursive Function .Write recursive function, recursionprob(n), which takes a positive number as its argument and returns the output as shown below. The solution should clearly write the steps as shown in an example in slide number 59 and slide number 60 in lecture slides. After writing the steps, trace the function for “recursiveprob(5)” as shown in an example slide number 61. Function Output: >> recursionprob(1) 1 >> recursionprob(2) 1 4 >> recursionprob(3) 1 4 9 >>recrusionprob(4) 1 4 9 16
please typed Let the function fun be defined as: int fun(int* k) { *k += 6; return 4 * (*k); } Suppose fun is used in a program as follows: void main() { int i = 10, j = 20, sum1, sum2; sum1 = (i / 2) + fun(&i); sum2 = fun(&j) + (j / 2); } Question: What are the values of sum1 and sum2 if a) operands in the expressions are evaluated left to right? b) operands in the expressions are evaluated right to left?
Describe a situation where the add operator in a programming languagewould not be commutative. ____________________________________________________________________ Let the function fun be defined asint fun(int *k) { *k += 4; return 3 * (*k) – 1;}Suppose fun is used in a program as follows:void main(){ int i = 10, j = 10, sum1, sum2;sum1 = (i/2) + fun(&i);sum2 = fun(&j) + (j/2);}What are the values of sum1 and sum2a. if the operands in the expressions are evaluated left to the right?b. if the operands in the expressions are evaluated right to the left?
Write a recursive function PrintPattern2 that receives two arguments: (i) a character ch; (ii) number of lines and print the pattern.Example:PrintPattern2('*',5) will print the following pattern
4. Design a recursive function that accepts an integer argument, n, and prints every second number from n down to a minimum of 0. Assume that n is always a positive integer.
in c++ The Fibonacci number is the one in which each number is the sum of the two precedingnumbers. An example is shown below:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...Write a recursive function that prints the first fifteen Fibonacci numbers. Your functionmust be recursive. Note that the first three Fibonacci numbers are 0, 1, 1, but after that ,the Fibonacci number is n = n - 1 + n - 2. Note that you will write only a function.
C++ Programming: Write a recursive function, sumDigits, that takes an integer as a parameter and returns the sum of the digits of the integer. Also, write a program to test your function. Your program should prompt the user for an integer and output the results to the console.
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
Solve the problems Solve the quadratic equation 2x^2 + 6x + 4 = 0. Implement a function that takes incoefficients A,B,and C forthequadratic equation Ax2 + Bx + C = 0 and computes the two solutions. Have the function return the number of valid (not NaN) solutions and fill in the return arguments so the smaller of the two solutions is first.
1. Write a recursive function that takes a string as an input and returns the reverse of the string. 2.Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: *ede cde bcde abcde Method call rec_string(‘abc’), will produce the following output: *cbc abc 3. Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two positive integers. gcd is the largest integer that divides evenly into both of them. For example, the gcd(102, 68) = 34. You may recall learning about the greatest common divisor when you learned to reduce fractions. For example, we can simplify 68/102 to 2/3 by dividing both numerator and denominator by 34, their gcd. Finding the gcd of huge numbers is an important problem that arises in many commercial applications. We can efficiently compute the gcd using the…
(C Language) Write a recursive function called DrawTriangle() that outputs lines of '*' to form a right side up isosceles triangle. Function DrawTriangle() has one parameter, an integer representing the base length of the triangle. Assume the base length is always odd and less than 20. Output 9 spaces before the first '*' on the first line for correct formatting. Hint: The number of '*' increases by 2 for every line drawn.