0
Add your answer:
Earn +20 pts
Is a linear equation the same as a function?
No a linear equation are not the same as a linear function. The linear function is written as Ax+By=C. The linear equation is f{x}=m+b.
What is a mere relation?
A relation is an expression that is not a function. A function is defined as only having one domain per range, meaning that when graphed, a function will have no two points on the same vertical line. If your expression is graphed and two points do appear on the same vertical line, it is a relation, not a function.
How do you find the compositeof a given function?
The term "composition" refers to applying one function after another. It is not usually used for a single function, although you can of course apply the same function twice.
How do you determine if a function is even or odd?
You can tell if a function is even or odd by looking at its graph. If a function has rotational symmetry about the origin (meaning it can be rotated 180 degrees about the origin and remain the same function) it is an odd function. f(-x)=-f(x) An example of an odd function is the parent sine function: y=sinx If a function has symmetry about the y-axis (meaning it can be reflected across the y-axis to produce the same image) it is an even function. f(x)=f(-x) An example of an even function is the parent quadratic function: y=x2
How do you tell if a function is even or odd?
You can tell if a function is even or odd by looking at its graph. If a function has rotational symmetry about the origin (meaning it can be rotated 180 degrees about the origin and remain the same function) it is an odd function. f(-x)=-f(x) An example of an odd function is the parent sine function: y=sinx If a function has symmetry about the y-axis (meaning it can be reflected across the y-axis to produce the same image) it is an even function. f(x)=f(-x) An example of an even function is the parent quadratic function: y=x2
Will the explicit formula find the same answer when using the recursive formula?
It is often possible to find an explicit formula that gives the same answer as a given recursive formula - and vice versa. I don't think you can always find an explicit formula that gives the same answer.
What is the difference between function and recursive function?
I will explain in the easiest way the difference between the function and recursive function in C language. Simple Answer is argument of the function is differ but in the recursive function it is same:) Explanation: Function int function(int,int)// function declaration main() { int n; ...... ...... n=function(a,b); } int function(int c,int d) { ...... ...... ...... } recursive Function: int recursive(int,int)// recursive Function declaration main() { int n; ..... ..... ..... ..... n=recursive(a,b); } int recursive(int a,int b) { ..... .... .... .... } Carefully see, In the recursive Function the function arguments are same.
What recursive formulas represents the same arithmetic sequence as the explicit formula an 5 n - 12?
-7
What is self referential function in c plus plus?
A self-referential function in C++, or in any other supporting language, is a recursive function.
What is a recursive formula and what is it used for Geometric and Arithmetic?
A recursive definition is any definition that uses the thing to be defined as part of the definition. A recursive formula, or function, is a related formula or function. A recursive function uses the function itself in the definition. For example: The factorial function, written n!, is defined as the product of all the numbers, from 1 to the number (in this case "n"). For example, the factorial of 4, written 4!, is equal to 1 x 2 x 3 x 4. This can also be defined as follows: 0! = 1 For any "n" > 0, n! = n x (n-1)! For example, according to this definition, the factorial of 4 is the same as 4 times the factorial of 3. Try it out - apply the recursive formula, until you get to the base case. Note that a base case is necessary; otherwise, the recursion would never end.
What is recursive calls.which data structure is used in it?
A recursive call is any function that calls itself with modified parameters. There is no data structure associated with it, other than the call stack which is associated with all function calls, recursive or not. The stack is used to store the state of the current instance's local variables, the return address, and the arguments to be passed to the next instance. This allows recursive calls to "unwind" in the reverse order they were called. Recursive functions must have a terminating condition as all the recursive calls must eventually return to the original caller at some point. If they don't, they'll simply keep calling themselves until there's no more space on the stack. Recursive functions are commonly used in divide-and-conquer algorithms, gradually reducing larger problems down to smaller instances of the same problem until a terminating condition is satisfied. As the calls return, the larger problem is gradually solved until the function returns to the original caller, at which point the entire problem is fully resolved. Quicksort is a typical algorithm that makes use of recursion.
What is a recursive call. Which data structure is used in it?
Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.
What differences between reentrant function and recursive function?
A reentrant function is called by the program during execution and can be interrupted and recalled later. A recursive function can call itself during execution and repeats itself without interruption.
What declaration should be used to use variable as recursive?
Variables in C are not recursive. Functions are recursive.Note that for functions to be truly recursive, they must only use arguments passed to them or automatic storage allocated from the stack. If they use other storage, they must implement a method of properly allocating and deallocating recursion instance variables. The classic example of a recursive function is the factorial function...int factorial (int n) { if (n
What is the function rules of input and output?
The rule is what actions (operations) the function performs. The only requirement is that for each imput there is an output and that the same input always results in the same output. (Different inputs can have the same output).
Why recursive and non-recursive delivers wrong result?
Recursive and non-recursive (also known as iterative) are simply two different approaches to solving a problem. Properly implemented, they should give the same result. If they do not, then something is wrong, and you should spend the time to figure out why.This is a generic answer, because the topic is too broad to answer here, as there are many different reasons that a particular algorithm may fail.
How the stack memory is getting affected when performing the recursive operation in C?
Each time you call a function, a new stack page is created for that function. The same happens when a function recursively calls itself. Small functions or functions that are seldom invoked can be inline expanded by the language compiler or linker to reduce stack usage. However recursive functions are generally only expanded to a specified depth of recursion; all remaining recursions are handled by the usual function call mechanism. The stack page of a function is used to store the function's return address, formal arguments and local variables, as well as to provide exception handling information where required. Invoking a function is more costly than executing the same code inline due to the need to instantiate a stack page and copy values to it. However, functions make our code much easier to read and maintain while inline expansion helps to eliminate the cost of calling a function.
