Given an integer n, what does the following function compute?
int function(int n)
{
int i;
for(i = 0; n != 0; n %=10, i++)
return i;
}
The given function computes the number of digits in the integer n. Here's how it works:
- The function initializes an integer variable
ito 0. - It enters a _______ ________ _______ _________ _________ _______ ____ ________.
______ ____ _____ ________ ____ _______ ________ _______ ___ ________ ________ ________.
_______ ______ __________ ______ ___ _________ ______ ________ ___.
___ _____ ______ _________ ___ ____.
_______ __________ ________ _____ __________ ______ _________ __________.
_______ ______ _____ _____ _________ ____.
___ ________ ___ _________ _____.
_______ ________ ____ ________ ________ __________ _________ __________ _________ _________ ________.
________ ____ _______ ________ ___ ___ _____ _______.
______ __________ _______ ________ _____.
_______ _________ _______ __________ _____ ________ _____.
____ _______ _____ __________ __________ ________ _____ ______ ___ _____ ____ __________.
_________ __________ __________ __________ ______ ____ _________ _________ __________ ________.
______ ________ _____ _________ ____ ____ ___ _______.
_____.
Get Full Answer on WhatsApp
Suppose you wish to solve the equation x5 + 3x2 − 10 = 0 for x. Rearrange this equation to get an appropriate fixed point iteration method. Then write a program to get an approximate value of the root of the equation. The initial guess must be entered by the user. Your programme must be able to flag a warning message if the initial guess is too far from the exact root. In that case, your program must be able to suggest an initial guess to the user. Terminate the program and print the current value of the root as soon as the difference between two successive approximations becomes smaller than 0.005.
Explain the use of the string library functions strncpy() and strncat(), with the help of an example for each.
Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.
zWrite a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa.
Write the inorder, preorder and postorder traversals of the following binary search tree.
Explain how will you allocate memory dynamically for a two dimensional array of floating point numbers.
Parenthesise the following C statement for its proper evaluation.
x + = a%b + c ∗ d/e ! = f + + − g
Further, if all the variables from a to g are initialised by 2, then what will be the value of x?