2) Let array a be (5,49,8,7,3,12,0,6) and b be the last digit of your student number.Accordingly, if we run the given functions in the following order, what will be theoutput? Explain step by step.functionl (a, b);print (a, b);function2 (a, & b);print (a, b);void print(int a[].int b){for(int i=0:i<10:i+){printi"%d ",a[i]):printf("nb=%dn",b).void function1 (int a].int b){a[b)=a[b]+b:b=b+2:void function2(int a[].int *b){a[*b]=[*b]-*b:

Create a main() method, initialize the variable array a with the specified values, and then create…

2) Let array a be 549,813120,6) and b be the last digit of your student mumber Accordingly, if we run the given functions in the following order, what will be the output? Erplain step by step. functionl (a, b): print (a, b); function2 (a, & b); print (a, b); void printfint a[]int b){ for(int i=i-10i-){ printid"ai) printf b=dn".b). void function1(int a[]-b){ void finction2(int aint "b){

2) Let array a be 549,813120,6) and b be the last digit of your student mumber Accordingly, if we run the given functions in the following order, what will be the output? Erplain step by step. functionl (a, b): print (a, b); function2 (a, & b); print (a, b); void printfint a[]int b){ for(int i=i-10i-){ printid"ai) printf b=dn".b). void function1(int a[]-b){ void finction2(int aint "b){

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

Write a function 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
Question: Given an array of integers, find the maximum and minimum elements present in the array. Your task is to write a function that takes an array of integers as input and returns the maximum and minimum elements as a pair of integers..
I need help with this in C++: Write a pair of functions countEven(int *, int) and countOdd(int *, int) which receive an integer array and its size, and returns the count of even or odd numbers in the array.
For the following question, you are only allowed to use the following built-in functions: print(), range(), and len() write this code in python: Suppose you have the following animal names in a list: cat, dog,mouse, hamster. Write a code that prints the first letter, the last letter, andthe length of each animal’s name. Print out all the animal names that havea length greater than 3. and explain what you did
C++ A word is considered elfish if it contains the letters: e, l, and f in it, in any order. For example,we would say that the following words are elfish: whiteleaf, tasteful, unfriendly, and waffles,because they each contain those letters.Write a function called elfish that recursively checks, given a word, if that word is elfish or not.
8. using c++, Write a function method that determines the mean of all the values in an array of integers. Your mean function should call a separate function that you write that determines the sum. Don’t use built-in sum or mean gadgets, but roll your own.
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: Start with accumulator = A[0] For i=1...length-1 compute accumulator=f(accumulator, A[i]) 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));
-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs): if score ... : return 'A' ...: return 'A-' ...: return 'B+' ...: return 'B' ...: return 'B-'
You are asked to write a C function that finds the longest sequence of increasing numbers in an array. You should implement a function that receives an array passed as a parameter, and prints the longest sequence of increasing numbers. The prototype of the function MUST be: void longestSequence(int a[], int sizeA); For example, we have an int array with values as 1, 3, 10, -1, 7, 6, 10, 30, 0. Your code should identify the longest sequence of increasing numbers and print Longest sequence is -1, 7, 6, 10, 30. Array size cannot be 0
Write and test the “digit” function: Function Prototype: int digit(int n,int k)This function returns the kth digit of the positive integer n. For example, if n is the integer 29,415 that is entered by user , then the call digit(n,0) would return the digit 2, and the call digit(n,2) would returnthe digit 4. do this only by using functions and loops. arrays are not allowed. example :Input: n = 29415 , k = 1 output: 9 Input: n = 2 , k = 1 output: index out of bound (return -1)
Write the appropriate function definition for each of the following situations: b) Write a function that computes two sums from the elements of an array of integers. Each element of the array contributes to one of the two sums, depending on whether the element itself is even or odd. Your function definition should look like this:void sum(int x[ ]){ int n;int sum_even;int sum_odd;::}
Take a sorted array of 15 elements of type int and a value x from user, you need to find the ceilingand floor of x. The ceiling of x is the smallest element in array greater than or equal to x, and thefloor is the greatest element smaller than or equal to x. Assume than the array is sorted inascending order. Write a c++ program using functions to find floor and ceiling of x from the given array.Examples : For example, let the input array be {1, 2, 8, 10, 10, 12, 19}For x = 0: floor doesn't exist in array, ceil = 1For x = 1: floor = 1, ceil = 1For x = 5: floor = 2, ceil = 8For x = 20: floor = 19, ceil doesn't exist in array