Write a C function to calculate and return the factorial value of any positive integer as an argument. Then call this function from main() and print the results for the following input values: 2, 3,4, 5, 10, 15 What is the maximum value of an integer for which factorial can be calculated correctly on a machine using your algorithm

Write a C function to calculate and return the factorial value of any positive integer as an argument. Then call this function from main() and print the results for the following input values: 2, 3,4, 5, 10, 15 What is the maximum value of an integer for which factorial can be calculated correctly on a machine using your algorithm

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 5SA

See similar textbooks

Similar questions

In C++ Just answer the questions in simple code please. Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. Do this in a function called Sierra.
Please solve the question by using MATHEMATICA, Write a function to randomly mix up the characters in a word. For example, if the input is "homework", you might output "eoomkwhr" or "wrhomoke". Your function should work on any input length, and all of the input letters must appear in the output.
I need help in finishing this C Program with Fill in the Blanks of the program The function works as following 1 printf("%d", addOddHash(123, 3)); 4 2 printf("%d", addOddHash(23456, 5)); 8 3 printf("%d", addOddHash(2468, 4)); 0 /* This function returns the sum of all odd digits(i.e., 1, 3, 5, 7, 9) in n. @param n - input value @param nNumDigits - number of digits in n @return the sum of all odd digits in n.*/int addOddHash(int n, int nNumDigits) { int i;int nDigit; int nResult = 0; for(i = 0; i <= nNumDigits; i++) { nDigit = _(a)_; // get the rightmost digit if(nDigit % 2) nResult += _(b)_; else nResult += _(c)_; n /= 10; // remove the rightmost digit } return nResult;}
please provide the answer in C++ with simple step by step coding 9. (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs increment the counter variable that's keeping count of the 1s that occur; and so on. finally display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
considering the prototype float minMax (float* array, int size, float* min, float* max); - in c code, how would you write the code for the function? would i include both for loops to find the min and max? i.e. all of below would go in the one function? that doesn't seem right? i'm not sure how to tweek it accordingly? float minimum(float array[], int size){int i;float min = array[0]; // min initialized to first elementfor(i=1;i<size;i++){ if(array[i] < min) //element is compared with min min = array[i];}return min;} float maximum(float array[], int size){int i;float max = array[0]; // max initialized to first elementfor(i=1;i<size;i++){ if(array[i] > max) //element is compared with max max = array[i];}return max; -- what if i needed to add a third value to this like address? would it then be a void function? how would that work? void arrayMinMaxAvg (float* array, int size, float* min, float* max, float* avg) - for example, is this even possible?
Write a “C” program to find the summation of the following series: 1/8+ 1/27 + 1/64 + 1/125 + 1/216 + .............. + 1/(n+1)3Hint: To compute the power of a number, you can apply basic mathematics multiplications equations or use the pow() function computes the power of a number.The basic mathematics multiplications equations:For example: [In Mathematics] x4 = x*x*x*x [In programming]The pow() function:The pow() function takes two arguments (base value and power value) and, returns the power raised to the base number.For example, [In Mathematics] xy = pow(x, y) [In programming]The pow() function is defined in <math.h> header file (#include<math.h>)
Consider the two versions of the function computing the combinations. Add a global variable counter and increment it by one at the top of both functions. This will count the number of function calls required to complete the calculations in each case. Try the two versions of the function for a few pairs of numbers n and m and print out the value of the counter after each of them. Don't forget to reset the counter to 0 before each call. Comment on the observed difference between the numbers of function calls.
i need the answer of this question in C++. functions Write a program whose inputs are three integers, and whose outputs are the largest of the three values and the smallest of the three values. Ex: If the input is: 7 15 3 the output is: largest: 15 smallest: 3 Your program must define and call the following two functions. The LargestNumber function should return the largest number of the three input values. The SmallestNumber function should return the smallest number of the three input values.int LargestNumber(int num1, int num2, int num3)int SmallestNumber(int num1, int num2, int num3)
Q1.What is the smallest 32-bit floating point number f such that 128 + f > 128 ? What is the smallest 32-bit floating point number g such that 1 + g > 1 ? What is the relationship between f and g? Where f and g are differentiable functions. We have found that the given functions have the same derivative. In general, if two differentiable functions differs by a constant at x, its derivatives slopes at this point are the same. Write a short C++ or Python program to support your answer (for example, show that you checked whether there is no smaller number than your f by trying 128+f/2 == 128. Q2. Explain what changes are needed to change the 4x3 memory presented on Slide 62 of Chapter 3 to a 16x6 memory.
Problem 3. write a C++ function that finds as many primes of the form 2n + 1, where n is a positive integer, as you can.
Could you help me solve this and explain each step I am confused: Write a C function to convert any positive decimal number as an argument into binary. Then call this function from main( ) and display the following decimal values in binary format using your function: 1, 2, 10, 1001, 90250
You are asked to write a simple C program that will accept an integer value in the range of 5-95 and as a multiple of 5 representing the number of cents to give to a customer in their change. The program should calculate how many coins of each denomination and display this to the user. Valid coin values are 50, 20, 10 and 5. Your solution (program and algorithm) should be modular in nature. This requires the submission of a high-level algorithm and suitable decompositions of each step. Note that for this problem the principle of code reuse is particularly important and a significant number of marks are allocated to this. You should attempt to design your solution such that it consists of a relatively small number of functions that are as general in design as possible and you should have one function in particular that can be reused (called repeatedly) in order to solve the majority of the problem. If you find that you have developed a large number of functions which each performs a…