#13.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, auml, sum2;suml - (1/2) + fun (si):sum2 = fun (6j) + (0/2);What are the values of suml and sum2?a. 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?

#13. 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, auml, aum2; suml - (1/2) + fun (61): sum2 - tun (6j) + (0/2): What are the values of suml and sum2? a. 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?

#13. 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, auml, aum2; suml - (1/2) + fun (61): sum2 - tun (6j) + (0/2): What are the values of suml and sum2? a. 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?

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 12PE

See similar textbooks

Similar questions

12. Consider the recursive function int gcd( int a, int b) int gcd( int a, int b){ if (b > a) return gcd(b,a); if ( b == 0 ) return a; return gcd( b, a% b); } How many invocation (calls) of the gcd() function will be made by the call gcd(72, 30)?
I need to complete this table, JAVA. Assuming an unsorted Map starting with no contents, describe the return values and contents of the map (initial values on the left) after the operation, when done in order. Also Assume entries are in (key,value) format. The first three function calls are completed. FUNCTION CONTENTS RETURN VALUE isEmpty() {} true put(5,X) {(5,X)} null put(7,F) {(5,X),(7,F) null put(2,C) put(8,D) put(2,E) get(7) put(7,Y) get(4) put(4,X) get(4) size() remove(5) isEmpty() size()
Consider the following function definition.void mystery(int* x){// function body } Inside the definition of mystery, the C++ language provides a way to distinguish if x points to a lone int value or to an int allocated as part of a larger array.A. True B. False
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).
1. Write a C program to count Non-Armstrong numbers from m and n (including m and n also) using the concept of passing pointers to function. Pass addresses of m, n and count integers from the main () function to the user defined function: calculate () [Function is not returning any value], and display the count in the main () function. 2. Write a program which should consists of a user defined function “Task ()” [Function returns no value]. Pass 1D array to the function, along with number of elements of array and element to search. Function should implement linear search, and if the element is not found in the array, then insert that element at the end of array .Display the final array after insertion [After function is called] in the main () function. [Note: Array should be passed using by reference approach]
Please written by computer source Question 1: Suppose we wish to write a procedure that computes the inner product of two vectors u and v. An abstract version of the function has a CPE of 14–18 with x86- 64 for different types of integer and floating-point data. By doing the same sort of transformations we did to transform the abstract program combine1 into the more efficient combine4, we get the following code: Our measurements show that this function has CPEs of 1.50 for integer data and 3.00 for floating-point data. For data type double, the x86-64 assembly code for the inner loop is as follows: Assume that the functional units have the characteristics listed in Figure 5.12. **See last page for figures A. Diagram how this instruction sequence would be decoded into operations and show how the data dependencies between them would create a critical path of operations, in the style of textbook Figures 5.13 and 5.14. vmovsd vmovsd vmulsd vaddsd | | | |…
Consider the following recursive function: def rec1(aList,first,last): if first==last: return aList[first] else: return aList[last]*rec1(aList,first,last-1) Show the output of the following call (show your work and all recursive calls): print(rec1([1,2,3,4,5,6,7],3,5))? describe the task of the rec1 function.
Computer Science Consider the following Haskell functions:step x y = y + 1mystery iL = foldr step 0 iLWhat will the following expression evaluate to , show the execution and explainmystery ["ab","bc","cd","bc"]
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;}
Question Description Consider the following C function: long func(long x, long y, long z) { long ti = x + 3; long t2 - 2 + ti; long t3 - y + 5; long t4 = y = 33; long t5 - t3 + 14; long rval t2 + t5; return rval; } Show that the assembly code below is a correct translation of this program, by (a) giving an expres- sion for the value func() returns, and (b) filling in the table below the assembly code, showing the contents of each register in terms of x, y and z after each of the first six instructions is executed. The first row shows register contents before the first instruction. Remember that the sequence of assembly instructions may not correspond exactly to the C code, as the compiler may rearrange things to minimize the number of instructions and registers
Write a C++ program for the following In this task, your job is to create a function Swapper() that takes three arguments num1,num2, and difference. The first argument should be passed by pointer, second argumentshould be passed by reference, and third argument should be passed by value. YourSwapper function should first swap the values of num1 and num2 with each other, andthen compute the difference of most significant digits of both numbers. You have to storethe difference result in difference variable. In the end, you need to display the values ofall three variables inside your Swapper method as well as in your main function.Note: You are not allowed to create any other variable or pointer inside your Swappermethod.
C/C++ & MIPS The function ?add(?,?) for two positive integers 0≤?, and 0≤?, is defined as the following:?add(?,0)=?; ?add(?,?)=?add(?,?−1)Write a recursive version of ?add() in C or C++, then use this program to develop a MIPSprogram that gets as input two integers 0<? ≤255, and 0<? ≤255, and returns theresult of ?add(?,?) in $v1.Your deliverable should be the C/C++ code and the MIPS assembly function-code