Implementing Numerical Integration Using Function Pointers The problem is to write a function "integrate" with prototype: //FUNC represents functions of one variable that take a double as input and returns a double typedef double (*FUNC)(double); double integrate(FUNC f, double a, double b); so that when it is passed a function fand bounds a and b, the call: integrate(f, a,b) will return the value of the definite integral of f evaluated between a and b. test integrate on the following three functions: 1. double line(double x){ return x; { 2. double square(double x}{ return x*x; { 3. double cube(double x){ return x*x*x; { And the following main function: int main(){ cout<< "The integral of f(x)=x between 1 and 5 is: "

Implementing Numerical Integration Using Function Pointers The problem is to write a function "integrate" with prototype: //FUNC represents functions of one variable that take a double as input and returns a double typedef double (FUNC)(double); double integrate(FUNC f, double a, double b); so that when it is passed a function fand bounds a and b, the call: integrate(f, a,b) will return the value of the definite integral of f evaluated between a and b. test integrate on the following three functions: 1. double line(double x){ return x; { 2. double square(double x}{ return xx; { 3. double cube(double x){ return xxx; { And the following main function: int main(){ cout<< "The integral of f(x)=x between 1 and 5 is: "

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

float theRealQuestion (int x, float y) { int z; if (x > 15) z = x; else z = y; return z; } Code the function prototype for the given function.
function myCompose(f,g){// TODO: return (f o g);// that is, a function that returns f(g(x)) when invoked on x.}
Computer Science In C++ use the following STL algorithms: reverse, rotate, and shuffle. Write versions of these functions using the same parameters as the original functions but using your own definition of the function body. Use each function at least three different times in a test program to make sure the function operates properly. The data sets you use for testing should contain at least twenty elements
Write the following three functions in c programming language: 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));
Write a function which takes two integer parameters for values to be added together and returns the result by value. The function may not print anything or read anything directly from the user (i.e. no cin/cout in the function). Assume that the values passed to the function will not be negative, but could be 0 or positive, and will both be integers. The function must implement addition recursively, and cannot use the standalone + operator (only ++) or call any other functions.
In c++, write a function void zero(int a[], int size, int target) that sets all elements of a larger than target to zero. Include a sensible main function which calls the function and prints out the results.
In C++ Write a recursive function that displays a string reversely on the console using the following header:void reverseDisplay(const string& s) For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
A recursive function in programming is a function that calls itself during its execution. The following two functions are examples of recursive functions: def function1(length): if length > 0: print(length) function1(length - 1) def function2(length): while length > 0: print(length) function2(length - 1) What can you say about the output of function1(3) and function2(3)? The two functions produce the same output 3 2 1. function1 produces the output: 3 2 1 and function2 runs infinitely. 3. function1 produces the output: 3 2 1 and function2 runs infinitely. 4. The two programs produce the same output: 1 2 3
Consider the following function: void fun_with_recursion(int x) { printf("%i\n", x); fun_with_recursion(x + 1); } What will happen when this function is called by passing it the value 0?
Define Arrays as Parameters to Functions.
In a function aFunction, we have 2 values: num1 (float type), num2 (int type) declared locally and assigned to 2.1 and 6. Write code segment to return the two values from function aFunction.
Write a program in C that includes the following functions: A function elementsSummation() that takes an integer array and the array size as arguments and prints the summation of the array’s elements. A function smallestElement() that takes the array and its size as arguments and returns the smallest element of the array. A recursive function integerReverse() that takes the array, start index, and the array size as arguments and prints the array back to front.